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;
const long long int MX = 1000005;
int val[100005], wt[100005];
long long int knapSack(int W, int n) {
  if (n == 0 || W == 0) return 0;
  if (wt[n - 1] > W)
    return knapSack(W, n - 1);
  else
    return max(val[n - 1] + knapSack(W - wt[n - 1], n - 1), knapSack(W, n - 1));
}
int main() {
  int n, i;
  int W;
  scanf("%d %d", &n, &W);
  for (i = 0; i < n; i++) scanf("%d %d", &wt[i], &val[i]);
  printf("%lld", knapSack(W, n));
  return 0;
}
