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

int strcmp( const char *A, const char *B){
    return strcmp (*(char * const *)A, (*(char * const *)B);
}


int main () {


    char A[101];
    char B[101];
    char C[101];


    scanf("%s", A);
    scanf("%s", B);
    scanf("%s", C);

    if ( (strcmp (A[sizeof(A)],B[0]) ==0 ) && (strcmp (B[sizeof(B)],C[0])==0) ){
        printf("YES");
    } else {
        printf("NO");
    }

    return 0;
}
