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 <bits/stdc++.h>
int main(void) {
  char s[3][10];
  int sl[3];
  int i;
  scanf("%s %s %s", s[0], s[1], s[2]);
  for (i = 0; i < 3; i++) {
    sl[i] = strlen(s[i]);
  }
  if (s[0][sl[0] - 1] == s[1][0]) {
    if (s[1][sl[1] - 1] == s[2][0]) {
      puts("YES");
    } else {
      puts("NO");
    }
  } else {
    puts("NO");
  }
  return 0;
}
