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 MOD = (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);
int ans = 0, id;
int N, M;
int A, B, C;
string O, E;
long long int sum = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> A >> B >> C;
  int temp = A % B;
  N = temp;
  for (int i = (A); i < (A * B); i++) {
    if ((A * i) % B == C) {
      N = 1;
      break;
    }
  }
  if (N == 1)
    cout << "YES";
  else
    cout << "NO";
  cout << endl;
  return 0;
}
