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
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define print(a) cout << a << endl
#define V vector
typedef string str;
#define rep(i,n) for(int i=0;i<n;i++)

int main() {
	V<str> s(3);
	bool chk=true;
	rep(i,3){
		cin >> s.at(i);
		if(i>0){
			if(s.at(i).at(0)!=s.at(i-1).at(s.at(i-1).size()))chk==false;
		}
	}
	if(chk){
		print("YES");
	}else{
		print("NO");
	}
	print(s);
	return 0;
}