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], a, b;
  int n;
  scanf("%s%s%s", A, B, C);
  for (n = 0; n <= 9; n++) {
    if (A[n] != '\0' && A[n + 1] == '\0') {
      a = A[n];
    } else if (B[n] != '\0' && B[n + 1] == '\0') {
      b = B[n];
    }
  }
  if (a == B[0] && b == C[0]) {
    printf("YES");
  } else {
    printf("NO");
  }
  return 0;
}
