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>
int	main(void)
{
	int front = 0,back;//頭、最後
	char str1[256],str2[256],str3[256];
	scanf("%s %s %s",&str1,&str2,&str3);


	back = strlen(str1);
	if(str2[front] == str1[back-1]){
		back = strlen(str2);
		if(str3[front] == str2[back-1]){
				printf("YES");
			}
	}else{
		printf("NO");
	}
	return	0;
}