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>

int main () {
    char A[101];
    char B[101];
    char C[101];
    scanf("%s", A);
    scanf("%s", B);
    scanf("%s", C);

    char aux;

//para ser uma cadeia de palavras, última letra de A, tem que ser igual a última
//de b e a primeira de B tem que ser igual a última de C.
    for (int i=0; i<100; i++){
        if (int strcmp(const char *A, const char *B && const char *B, const char *C));
            printf("\n",YES);
    }
    if else{
        printf ("\n", NO);
    }
    return 0;
}
