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 dp[100000000];
int max(int a, int b) { return a > b ? a : b; }
int main() {
  int n, v;
  int i, j;
  long long W, w;
  memset(dp, 0, sizeof(dp));
  scanf("%d %lld", &n, &W);
  for (i = 1; i <= n; i++) {
    scanf("%lld %d", &w, &v);
    for (j = W; j >= w; j--) dp[j] = max(dp[j], dp[j - w] + v);
  }
  printf("%d\n", dp[W]);
  return 0;
}
