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() {
  char s[3][10];
  for (int i = 0; i < 3; i++) {
    scanf(" %s", &s[i]);
  }
  for (int i = 0; i < 3; i++) {
    printf("%s\n", s[i]);
  }
  int count[3];
  for (int i = 0; i < 3; i++) {
    count[i] = 0;
  }
  for (int i = 0; i < 3; i++) {
    for (int j = 0;; j++) {
      if (s[i][j] == '\0') {
        count[i] = j;
        break;
      }
    }
  }
  if (s[0][count[0] - 1] == s[1][0] && s[1][count[1] - 1] == s[2][0]) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }
  return 0;
}
