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, W;
  cin >> N >> W;
  int wList[N + 1];
  wList[0] = 0;
  int vList[N + 1];
  vList[0] = 0;
  for (int i = 1; i <= N; i++) {
    cin >> wList[i] >> vList[i];
  }
  int dp[N + 1][W + 1];
  for (int n = 0; n < N + 1; n++) {
    for (int w = 0; w < W + 1; w++) {
      if (n == 0) {
        dp[n][w] = 0;
      } else {
        if (w - wList[n] < 0) {
          dp[n][w] = dp[n - 1][w];
        } else {
          dp[n][w] = max(dp[n - 1][w - wList[n]] + vList[n], dp[n - 1][w]);
        }
      }
    }
  }
  cout << dp[N][W] << endl;
  return 0;
}
