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 func(int, int);
int N, W, V = 0, w[100], v[100], memo[1000][1000];
int main(void) {
  cin >> N >> W;
  for (int i = 0; i < N; i++) {
    cin >> w[i] >> v[i];
  }
  V = func(0, W);
  cout << V << endl;
}
int func(int i, int j) {
  int res;
  if (memo[i][j] != -1) return memo[i][j];
  if (i == N)
    res = 0;
  else if (j < w[i])
    res = func(i + 1, j);
  else {
    res = max(func(i + 1, j), func(i + 1, j - w[i]) + v[i]);
  }
  return memo[i][j] = res;
}
