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>
using namespace std;
char s1[10], s2[10], s3[10];
int a, b, c, j, k, loop, i, temp = 0;
int main() {
  cin >> s1;
  cin >> s2;
  cin >> s3;
  a = strlen(s1) - 1;
  b = strlen(s2) - 1;
  c = strlen(s3) - 1;
  for (i = 0; i < a; i++) {
    if (isupper(s1[i])) {
      temp++;
    }
  }
  for (j = 0; j < b; j++) {
    if (isupper(s2[j])) {
      temp++;
    }
  }
  for (k = 0; k < c; k++) {
    if (isupper(s3[k])) {
      temp++;
    }
  }
  if (temp == 0) {
    if (s1[a] == s2[0] && s2[b] == s3[0]) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
}
