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 (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>

int main()
{
	char A[15], B[15], C[15];
	scanf("%s %s %s", A, B, C);

	char *FirstB = B;
	char FirstB2 = FirstB[0];
	char *FirstC = C;
	char FirstC2 = FirstC[0];

	char *LastA = A;
	char LastA2;
	for (int i = 0;LastA[i] != '\0';i++)
	{
		LastA2 = LastA[i];
	}
	char *LastB = B;
	char LastB2;
	for (int h = 0;LastB[h] != '\0';h++)
	{
		LastB2 = LastB[h];
	}

	if (LastA2 == FirstB2 && LastB2 == FirstC2)
	{
		printf("YES\n");
	}
	else {
		printf("NO\n");
	}
	return 0;
}