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 nCr(long long n, long long r) {
  if (r > n) {
    return 0;
  }
  if (r * 2 > n) r = n - r;
  long long dividend = 1;
  long long divisor = 1;
  for (long long i = 1; i <= r; ++i) {
    dividend *= (n - i + 1);
    divisor *= i;
  }
  return dividend / divisor;
}
long long sumdigit(long long n) {
  long long dig = 0, sum = 0;
  while (n) {
    dig = n % 10;
    sum = sum + dig;
    n = n / 10;
  }
  return sum;
}
int main() {
  std::string a, b, c;
  std::cin >> a >> b >> c;
  if (a.end() == b.begin() && b.end() == c.begin()) {
    std::cout << "YES" << std::endl;
  } else {
    std::cout << "NO" << std::endl;
  }
}
