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 a[10], b[10], c[10];
  char at, bh, bt, ch;
  int i = 0;
  scanf("%s %s %s", a, b, c);
  bh = b[0];
  ch = c[0];
  for (i = 0; i < 10; i++) {
    if (a[i] == NULL) {
      at = a[i - 1];
      break;
    }
  }
  if (at != bh) {
    puts("No");
    return 0;
  }
  for (i = 0; i < 10; i++) {
    if (b[i] == NULL) {
      bt = b[i - 1];
      break;
    }
  }
  if (bt != ch) {
    puts("No");
    return 0;
  } else {
    puts("Yes");
  }
  return 0;
}
