# [Solution] Football Cup solution codechef

Football Cup solution codechef – It is the final day of La Liga. Chef has a certain criteria for assessing football matches.
In particular, he only likes a match if:

# [Solution] Football Cup solution codechef

• The match ends in a draw, and,
• At least one goal has been scored by either team.

Given the goals scored by both the teams as XX and YY respectively, determine whether Chef will like the match or not.

### Input Format

• The first line of input will contain a single integer TT, denoting the number of test cases. The description of TT test cases follows.
• Each test case consists of a single line of input containing two space-separated integers XX and YY — the goals scored by each team.

### Output Format

For each test case, output 𝚈𝙴𝚂YES if Chef will like the match, else output 𝙽𝙾NO.

You may print each character of the string in uppercase or lowercase (for example, the strings 𝚈𝚎𝚂YeS𝚢𝙴𝚜yEs𝚢𝚎𝚜yes and 𝚈𝙴𝚂YES will all be treated as identical).

## [Solution] Football Cup solution codechef

• 1T1001≤T≤100
• 0X,Y90≤X,Y≤9

### Sample Input 1

4
1 1
0 1
0 0
2 2


### Sample Output 1

YES
NO
NO
YES


## Football Cup solution Explanation

Test case 11: It is a draw in which both teams have scored a goal, Chef will like this match.

Test case 22: The game is not a draw. Hence, Chef will not like this match.

Test case 33: Neither team scored a goal, so Chef will not like this match.

Test case 44: It is a draw in which both teams scored 22 goals each. Chef will like this match.