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>
int N, W;
int w[10000];
int v[10000];
int dp[10001][10001];
int rec(int i, int j) {
  if (dp[i][j] >= 0) {
    return dp[i][j];
  }
  int val;
  if (i == N) {
    val = 0;
  } else if (j < w[i]) {
    val = rec(i + 1, j);
  } else {
    val = std::max(rec(i + 1, j), rec(i + 1, j - w[i]) + v[i]);
  }
  dp[i][j] = val;
  return val;
}
int main() {
  std::cin >> N >> W;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < N; i++) {
    std::cin >> w[i] >> v[i];
  }
  std::cout << rec(0, W) << std::endl;
  return 0;
}
