Bob received an assignment from his school: he has two numbers 𝐴A and 𝐵B, and he has to find the sum of these two numbers.Alice, being a good friend of Bob, told him that the answer to this question is 𝐶C.Bob doesn't completely trust Alice and asked you to tell him if the answer given by Alice is correct or not.If the answer is correct print "YES", otherwise print "NO" (without quotes).Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.The first and only line of each test case consists of three space-separated integers 𝐴,𝐵,A,B, and 𝐶C.Output FormatFor each test case, output on a new line the answer: YES if Alice gave the right answer, and NO otherwise.Each character of the output may be printed in either uppercase or lowercase, i.e, the outputs Yes, YES, yEs and yes will be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1000≤𝐴,𝐵,𝐶≤1000≤A,B,C≤100Sample 1:InputOutput31 2 34 5 92 3 6YESYESNOExplanation:Test case 11: 1+2=31+2=3, so Alice's answer is correct.Test case 22: 4+5=94+5=9, so Alice's answer is correct.Test case 33: 2+3=52+3=5 which doesn't equal 66, so Alice's answer is incorrect.

Chef and his girlfriend went on a date. Chef took 𝑋X dollars with him, and was quite sure that this would be enough to pay the bill. At the end, the waiter brought a bill of 𝑌Y dollars. Print "YES" if Chef has enough money to pay the bill, or "NO" if he has to borrow from his girlfriend and leave a bad impression on her.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single line of input, containing two space-separated integers 𝑋X and 𝑌Y.Output FormatFor each test case, output on a new line "YES" if Chef has enough money to pay the bill and "NO" otherwise.You may print each character of the string in either uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).Constraints1≤𝑇≤1001≤T≤1001≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput41 11 22 150 100YESNOYESNOExplanation:Test case 11: Since the money Chef has is equal to the bill, he will be able to pay the bill.Test case 22: Since the money Chef has is less than the bill, he will have to borrow from his girlfriend and leave a bad impression on her.Test case 33: Since the money Chef has is greater than the bill, he will be able to pay the bill.Test case 44: Since the money Chef has is less than the bill, he will have to borrow from his girlfriend and leave a bad impression on her.

Alice has scored 𝑋X marks in her test and Bob has scored 𝑌Y marks in the same test. Alice is happy if she scored at least twice the marks of Bob’s score. Determine whether she is happy or not.Input FormatThe first and only line of input contains two space-separated integers 𝑋,𝑌X,Y — the marks of Alice and Bob respectively.Output FormatFor each testcase, print Yes if Alice is happy and No if she is not, according to the problem statement.The judge is case insensitive so you may output the answer in any case. In particular YES, yes, yEsare all considered equivalent toYes`.Constraints1≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput2 1YesExplanation:Alice has scored 𝑋=2X=2 marks whereas Bob has scored 𝑌=1Y=1 mark. As Alice has scored twice as much as Bob (i.e. 𝑋≥2𝑌X≥2Y), the answer is Yes.

Alice and Bob were having an argument about which of them is taller than the other. Charlie got irritated by the argument, and decided to settle the matter once and for all.Charlie measured the heights of Alice and Bob, and got to know that Alice's height is 𝑋X centimeters and Bob's height is 𝑌Y centimeters. Help Charlie decide who is taller.It is guaranteed that 𝑋≠𝑌X=Y.Input FormatThe first line of input will contain an integer 𝑇T — the number of test cases. The description of 𝑇T test cases follows.The first and only line of each test case contains two integers 𝑋X and 𝑌Y, as described in the problem statement.Output FormatFor each test case, output on a new line AA if Alice is taller than Bob, else output BB. The output is case insensitive, i.e, both AA and aa will be accepted as correct answers when Alice is taller.Constraints1≤𝑇≤10001≤T≤1000100≤𝑋,𝑌≤200100≤X,Y≤200𝑋≠𝑌X=YSample 1:InputOutput2150 160160 150BAExplanation:Test case 11: In this case, 150<160150<160 so Bob is taller than Alice.Test case 22: In this case, 160>150160>150 so Alice is taller than Bob.

A digit is large if it is between 55 and 99, inclusive. A positive integer is large if all of its digits are large.You are given an integer x𝑥. Can it be the sum of two large positive integers with the same number of digits?InputThe first line contains a single integer t𝑡 (1≤t≤1041≤𝑡≤104) — the number of test cases.The only line of each test case contains a single integer x𝑥 (10≤x≤101810≤𝑥≤1018).OutputFor each test case, output YESYES if x𝑥 satisfies the condition, and NONO otherwise.You can output YESYES and NONO in any case (for example, strings yESyES, yesyes, and YesYes will be recognized as a positive response).ExampleinputCopy11133720013939381434987654321234567891111111111111111142019841069119outputCopyYESNOYESYESNOYESNOYESYESNONONoteIn the first test case, we can have 658+679=1337658+679=1337.In the second test case, it can be shown that no numbers of equal length and only consisting of large digits can add to 200200.In the third test case, we can have 696969+696969=1393938696969+696969=1393938.In the fourth test case, we can have 777+657=1434777+657=1434.

There are 𝑁N students including Chef in a school. The school bus has 𝑀M seats, and every student in the school travels on the bus.It is guaranteed that 𝑁≤𝑀N≤M, so that everyone will have a seat.Chef is happy when the school bus is not full.Given 𝑁N and 𝑀M, your task is to find out whether Chef will be happy.Input FormatThe only line of input will contain two space-separated integers 𝑁N and 𝑀M, denoting the number of students in the school and the number of seats in the school bus respectively.Output FormatFor each test case, output on a new line the answer: YES, if Chef will be happy, and NO otherwise.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).Constraints1≤𝑁≤𝑀≤101≤N≤M≤10Sample 1:InputOutput2 3YESExplanation:There are 22 students and 33 seats on the bus.So, there will be one empty seat on the bus and Chef will be happy.Sample 2:InputOutput6 6NOExplanation:There are 66 students and 66 seats on the bus.The bus will be full and Chef will not be happy.