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>
  2 #include <string.h>
  3 int main()
  4 {
  5    char a[11],b[11],c[11];
  6 
  7    scanf("%s%s%s",a,b,c);
  8    int anagasa = strlen(a);
  9    int bnagasa = strlen(b);
 10 
 11    if(a[anagasa-1]==b[0] && b[bnagasa-1]==c[0])
 12       printf("YES\n");
 13    else
 14       printf("NO\n");
 15    return 0;                                                                
 16       }
