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.io.BufferedReader;
import java.io.InputStreamReader;
 
public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line = br.readLine();
        String[] number = line.split(" ");
		int numberOfBaggage = Integer.parseInt(number[0]);
		int maxWeight = Integer.parseInt(number[1]);
		int[] w = new int[numberOfBaggage];
		int[] v = new int[numberOfBaggage];
		for(int i = 0; i < numberOfBaggage; i++) {
            line = br.readLine();
            number = line.split(" ");
		    w[i] = Integer.parseInt(number[0]);
		    v[i] = Integer.parseInt(number[1]);
		}
        if(w[0] >= maxWeight) {
            System.out.println("WA");
        } else {
		    System.out.println(dynamic(maxWeight, numberOfBaggage - 1, w, v));
        }
	}
	public static int dynamic(int mw, int num, int[] w, int[] v) {
		int result = 0;
		if(num != 0) {
			if(w[num] <= mw) {
				result = Math.max(dynamic(mw - w[num], num - 1, w, v) + v[num], dynamic(mw, num - 1, w, v));
			} else {
				result = dynamic(mw, num - 1, w, v);
			}
		} else {
			if(w[num] <= mw) {
				result = v[num];
			} else {
				result = 0;
			}
		}
		return result;
	}
}