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 mymax(int a, int b) { return (a > b) ? a : b; }
int N, W;
map<int, int> dp;
int main(void) {
  int i = 0;
  int wi = 0, vi = 0;
  scanf("%d %d", &N, &W);
  while (N--) {
    scanf("%d %d", &wi, &vi);
    for (i = W; i >= wi; i--) dp[i] = mymax(dp[i], dp[i - wi] + vi);
  }
  printf("%d\n", dp[W]);
  return 0;
}
