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
    import java.util.Scanner;
     
    public class Main{
      static long n,T,sum,x;
      static long[] tn;
     
      public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
     
        n = sc.nextInt();
        T = sc.nextInt();
        tn = new long[2000000];
        for(int i = 0; i < n; i++){
          tn[i] = sc.nextInt();
        }
     
        for(int i = 0; i < n; i++){
          x = tn[i+1]-tn[i];
          if(x < T && i != n-1){
            sum += x;
          }
          else{
            sum += T;
          }
        }
     
        System.out.println(sum);
      }
    }