Problem:
Score : 100 points

Problem Statement

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.

Sample Input 1

rng gorilla apple

Sample Output 1

YES

They form a word chain.

Sample Input 2

yakiniku unagi sushi

Sample Output 2

NO

A and B form a word chain, but B and C do not.

Sample Input 3

a a a

Sample Output 3

YES

Sample Input 4

aaaaaaaaab aaaaaaaaaa aaaaaaaaab

Sample Output 4

NO

Solution in C (Clang 10.0.0) (judge verdict: Accepted)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int main(void) {
	int i;
	int lena, lenb;
	char buf[128], *ch;
	char a[32], b[32], c[32];

	fgets(buf, sizeof(buf), stdin);
	ch = strtok(buf, " ");
	sprintf(a, "%s", ch);
	ch = strtok(NULL, " ");
	sprintf(b, "%s", ch);
	ch = strtok(NULL, " ");
	sprintf(c, "%s", ch);

	lena = strlen(a);
	lenb = strlen(b);

	if(a[lena - 1] == '\n') {
		lena -= 1;
	}
	if(b[lenb - 1] == '\n') {
		lenb -= 1;
	}
	if(a[lena - 1] == b[0] && b[lenb - 1] == c[0]) {
		printf("YES\n");
	} else {
		printf("NO\n");
	}

	return 0;
}