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
// inputに入力データ全体が入る
function Main(input) {
  input = input.split(" ");
  let a = parseInt(input[0]);
  let b = parseInt(input[1]);
  let c = parseInt(input[2]);
  
  a = a % b;
  flag = 0;
  for (let i=0; i<b; i++) {
    if (a*i%b===c) {
      flag = 1;
      break;
    }
  }
  if (flag === 1) {
    console.log("YES");
  } else {
    console.log("NO");
  }
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));