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() {
  int N, T, i, j, k, ans = 0;
  scanf("%d %d", &N, &T);
  vector<int> t_i(N);
  for (i = 0; i < N; i++) {
    scanf("%d", &t_i[i]);
  }
  for (i = 0, j = 0, k = 0; i < (t_i[N - 1] + T); i++, k--) {
    if (t_i[j] == i) {
      k = T;
      j++;
    }
    if (k > 0) ans++;
  }
  printf("%d", ans);
  return 0;
}
