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 <string.h>

typedef unsigned int uint;
#define BUF_SIZE (20)

int main(void)
{
	char strA[BUF_SIZE];
	char strB[BUF_SIZE];
	char strC[BUF_SIZE];
	int lengthA;
	int lengthB;
	int lengthC;
	char strA_End;
	char strB_Begin;
	char strB_End;
	char strC_Begin;

	scanf_s("%s %s %s", strA, BUF_SIZE, strB, BUF_SIZE, strC, BUF_SIZE);
	lengthA = strlen(strA);
	lengthB = strlen(strB);
	lengthC = strlen(strC);

	strA_End = strA[lengthA - 1];
	strB_Begin = strB[0];
	strB_End = strB[lengthB - 1];
	strC_Begin = strC[0];

	if((strA_End == strB_Begin) && (strB_End == strC_Begin)){
		printf("YES\n");
	} else {
		printf("NO\n");
	}
    
    return 0;
}
