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;
int main() {
  long N = 0;
  double T = 0.0;
  double t[10000];
  double result = 0.0;
  cin >> N >> T;
  for (int i = 0; i < 10000; i++) t[i] = 0;
  for (int i = 0; i < N; i++) cin >> t[i];
  for (int i = 0; i < 10000; i++) {
    if (t[i] < T)
      result += t[i];
    else
      result += T;
    if (i > 0 && t[i] < t[i - 1]) break;
  }
  cout << result;
}
