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[11], b[11], c[11], r;
  int i;
  scanf("%s%s%s", a, b, c);
  i = 0;
  while (a[i] != '\0') i++;
  r = a[i - 1];
  if (r == b[0]) {
    i = 0;
    while (b[i] != '\0') i++;
    r = b[i - 1];
  } else {
    printf("No\n");
    return 0;
  }
  if (r == c[0])
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
