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>
char a[10] = {};
char b[10] = {};
char c[10] = {};
int main() {
  int a_length, b_length, c_length;
  char a_first, a_last;
  char b_first, b_last;
  char c_first, c_last;
  scanf("%s %s %s", &a, &b, &c);
  a_length = strlen(a);
  b_length = strlen(b);
  c_length = strlen(c);
  a_first = a[0];
  a_last = a[a_length - 1];
  b_first = b[0];
  b_last = b[b_length - 1];
  c_first = c[0];
  c_last = c[c_length - 1];
  if (a_last == b_first && b_last == c_first) {
    printf("Yes");
  } else {
    printf("No");
  }
  return 0;
}
