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

int main(){
    char a[10];
    char b[10];
    char c[10];

    scanf("%s %s %s",a,b,c);


    int l,m,n;
    l = strlen(a);
    m = strlen(b);
    n = strlen(c);




        if((a[l-1]==b[0]) && (b[m-1]==c[0])) {
            printf("YES");

            return 0;
        }
       else {
            printf("No");

            return 0;

        }

}
