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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long N, K, A[200009];
  cin >> N >> K;
  for (long i = 0; i < N; i++) cin >> A[i];
  A[N] = A[N - 1] + (K + 2);
  long long i = 1, X = A[0], P = X, S = 0;
  while (i < N) {
    P = X;
    while (A[i] - X <= K) {
      X = A[i];
      i++;
    }
    S += (X - P + K);
    X = A[i];
  }
  cout << S;
}
