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 long n, w;
  cin >> n >> w;
  long long v[n][2];
  for (int i = 0; i < n; ++i) {
    cin >> v[i][0] >> v[i][1];
  }
  long long f[n][w + 1];
  memset(f, 0, sizeof(f));
  for (int i = 0; i < n; ++i)
    for (int j = 1; j <= w; ++j) {
      if (v[i][0] <= j)
        f[i][j] = max(f[i - 1][j], f[i - 1][j - v[i][0]] + v[i][1]);
      else
        f[i][j] = f[i - 1][j];
    }
  cout << f[n - 1][w] << endl;
}
