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 <string.h>
#include <stdio.h>
#include <stdlib.h>

int comp(const void *a, const void *b){
    
    const char *y=a, *x=b;
    
    return strcmp(x,y);
}

	//último carac. de A = 1º carac. de B
	//último carac. de B = 1º carac. de C
	
int main(){
	char A[100], B[100], C[100];
	
	for (int i = 0; i < 100; i ++){
		scanf("%s %s %s", &A[i], &B[i], &C[i]);
	}
	
	if (A[99] == B[0] && B[99] == C[0]){
		printf("YES\n");
	} else {
		printf("NO\n"); 
	}

	return 0;
}



