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 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>
int main(){
char A[10],B[10],C[10];
int p,q,r;
scanf("%s",A);
scanf("%s",B);
scanf("%s",C);
p=strlen(A)-1;
q=strlen(B)-1;
r=strlen(C)-1;
if((p>=1 && p<=10)&&(q>=1 && q<=10)&&(r>=1 && r<=10)){
if((A[0] >= 'a' && A[p] <= 'z') && (B[0] >= 'a' && B[q] <= 'z') && (C[0] >= 'a'&& C[r] <= 'z')){
    if((A[p]==B[0])&&(B[q]==C[0])){
        printf("YES\n");
    }
    else{
        printf("NO\n");
    }
}
}
return 0;
}