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() {
  int i, j = 0, flag = 0;
  char ward[3][11];
  scanf("%s%s%s", ward[0], ward[1], ward[2]);
  for (i = 0; i < 2; i++) {
    j = 0;
    while (ward[i][j] != 0) {
      j++;
    }
    if (ward[i][j - 1] != ward[i + 1][0]) flag = 1;
  }
  if (flag == 0)
    puts("NO");
  else
    puts("YES");
  return 0;
}
