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;
long long n;
long long dp[100 + 1][1000 + 1];
long long weight[100 + 1];
long long cost[100 + 1];
long long CAP;
long long func(long long i, long long w) {
  if (i == n + 1) return 0;
  if (dp[i][w] != -1) return dp[i][w];
  long long profit1 = 0, profit2 = 0;
  if (w + weight[i] <= CAP) profit1 = cost[i] + func(i + 1, w + weight[i]);
  profit2 = func(i + 1, w);
  dp[i][w] = max(profit1, profit2);
  return dp[i][w];
}
int main() {
  memset(dp, -1, sizeof(dp));
  scanf("%lld%lld", &n, &CAP);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld %lld", &weight[i], &cost[i]);
  }
  printf("%lld\n", func(1, 0));
  return 0;
}
