You are given three strings A, B and C. Check whether they form a word chain.

More formally, determine whether both of the following are true:

* The last character in A and the initial character in B are the same.
* The last character in B and the initial character in C are the same.



If both are true, print `YES`. Otherwise, print `NO`.

Constraints

* A, B and C are all composed of lowercase English letters (`a` - `z`).
* 1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.

Input

Input is given from Standard Input in the following format:


A B C


Output

Print `YES` or `NO`.

Examples

Input

rng gorilla apple


Output

YES


Input

yakiniku unagi sushi


Output

NO


Input

a a a


Output

YES


Input

aaaaaaaaab aaaaaaaaaa aaaaaaaaab


Output

NO
#include <stdio.h>
#include <conio.h>

int main(){
	char A[3][31];
	char B[11];
	char C[11];
	int c=0;
	scanf("%s",&A[0]);
	scanf("%s",&A[1]);
	scanf("%s",&A[2]);
	for(int j=0;j<2;j++){
	for(int i=0;i<36;i++){
		if(A[j][i]==0){
			if(A[j][i-1]==A[j+1][0]){
				c++;
				break;
			}
			printf("NO\n");
			return 0;
		}
	}
	}
	printf("YES\n");
	return 0;
}