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>

    int x,y,z;
    int strcmp(const char*a,const char*b,const char*c){
    a=*((*char)x), b=*((*char)y) ,c=*((*char)z);

    return strcmp(a,b,c);
 }



int main(){
    char a[18],b[25],c[28];


    for(int i=0; i < 18;i++){
        scanf("%s",a);
    }
    for(int j=0;j<25;j++){
        scanf("%s",b);
    }
    for (int k=0;k<28;k++){
        scanf("%s",c);
    }



        if ((strcmp(a[n-1],b[1])==0) && (strcmp(b[j-1],c[1])==0)){
            printf("YES\n");

        } else{
            printf("NO\n");
        }






    return 0;
}
