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>
long long int change_plus(long long int a) {
  if (a < 0) {
    return -a;
  }
  if (a >= 0) {
    return a;
  }
}
long long int big(long long int a, long long int b) {
  if (a >= b) {
    return a;
  } else {
    return b;
  }
}
long long int small(long long int a, long long int b) {
  if (a >= b) {
    return b;
  } else {
    return a;
  }
}
int main() {
  long long int n, m, k = 0;
  char str[15], str2[15], str3[15];
  scanf("%s%s%s", str, str2, str3);
  if (str[strlen(str) - 1] == str2[0] && str2[strlen(str2) - 1] == str3[0]) {
    printf("Yes");
    return 0;
  }
  printf("No");
}
