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 v[111], p[111], dp[111][111][333];
int main() {
  int n, m, w;
  cin >> n >> m;
  cin >> w >> v[0];
  p[0] = 0;
  for (int i = 1; i < n; i++) {
    int t;
    cin >> t >> v[i];
    p[i] = t - w;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      for (int k = 0; k <= n * 3; k++) {
        dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);
        if ((j + 1) * w + k + p[i] <= m)
          dp[i + 1][j + 1][k + p[i]] =
              max(dp[i + 1][j + 1][k + p[i]], dp[i][j][k] + v[i]);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n * 3; j++) {
      ans = max(dp[n][i][j], ans);
    }
  }
  cout << ans << endl;
  return 0;
}
