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.HashMap;
import java.util.Scanner;

public class Main {
	public static HashMap<Point,Integer> map = new HashMap<Point,Integer>();
	static int N,W;
	static int[] w,v;
	public static void main(String[] args){
		Scanner io = new Scanner(System.in);	
		N = io.nextInt();
		W = io.nextInt();
		w = new int[N+1];
		v = new int[N+1];
		
		for (int i = 0; i < N; i++) {
			w[i+1] = io.nextInt();
			v[i+1] = io.nextInt();
		}
		
		System.out.println(value(N,W));
	}
	public static int value(int i,int wMax){
		Point p = new Point(i,wMax);
		if(map.containsKey(p)){
			return map.get(p);
		}
		int val;
		if(i==0){
			val = 0;
		}else if(wMax<w[i]){
			val = value(i-1,wMax);
		}else{
			val = Math.max(value(i-1,wMax),value(i-1,wMax-w[i])+v[i]);
		}
		map.put(p,val);
		return val;
	}
}

class Point{
	int i;
	int w;
	public Point(int i, int w){
		this.i = i;
		this.w = w;
 	}
	@Override
	public boolean equals(Object p){
		return (i==((Point)p).i && w==((Point)p).w);
	}
}