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
using System;
using System.Collections.Generic;
using System.Linq;

namespace sentou
{
    class Program
    {
        static void Main(string[] args)
        {
            String[] s = Console.ReadLine().Split(' ');
            String[] ss = Console.ReadLine().Split(' ');
            int n = int.Parse(s[0]);
            int t = int.Parse(s[1]);
            int[] a = new int[n];

            for(int i = 0; i < n; i++){
                a[i] = int.Parse(ss[i]);
            }

            int ans = t;
            for(int i = 0; i < n - 1; i++){
                if(a[i+1]-a[i] < t){
                    ans += a[i+1] - a[i];
                }else if(a[i+1]-a[i] >= t){
                    ans += t;
                }
            }
            Console.WriteLine(ans);
        }
    }
}
