Chef defines a pair of positive integers (𝑎,𝑏)(a,b) to be a Oneful PairOneful Pair, if𝑎+𝑏+(𝑎⋅𝑏)=111a+b+(a⋅b)=111For example, (1,55)(1,55) is a Oneful PairOneful Pair, since 1+55+(1⋅55)=56+55=1111+55+(1⋅55)=56+55=111.But (1,56)(1,56) is not a Oneful PairOneful Pair, since 1+56+(1⋅56)=57+56=113≠1111+56+(1⋅56)=57+56=113=111.Which of these pairs are Oneful PairOneful Pair?

Chef has a sequence of 𝑁N integers, 𝐴1,𝐴2,...,𝐴𝑁A 1​ ,A 2​ ,...,A N​ . He likes this sequence if it contains a subsequence of 𝑀M integers, 𝐵1,𝐵2,...,𝐵𝑀B 1​ ,B 2​ ,...,B M​ within it. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.You will be given a sequence of 𝑁N integers, 𝐴1,𝐴2,...,𝐴𝑁A 1​ ,A 2​ ,...,A N​ followed by another sequence of 𝑀M integers, 𝐵1,𝐵2,...,𝐵𝑀B 1​ ,B 2​ ,...,B M​ . Given these, you have to tell whether Chef likes the sequence of 𝑁N integers(𝐴1,𝐴2,...,𝐴𝑁A 1​ ,A 2​ ,...,A N​ ) or not.Formally, output "Yes" if∃𝑖𝑑𝑥1,𝑖𝑑𝑥2,...,𝑖𝑑𝑥𝑀∣1≤𝑖𝑑𝑥1<𝑖𝑑𝑥2<...<𝑖𝑑𝑥𝑀≤𝑁∃idx 1​ ,idx 2​ ,...,idx M​ ∣1≤idx 1​ <idx 2​ <...<idx M​ ≤N and 𝐴𝑖𝑑𝑥𝑖=𝐵𝑖∀𝑖,1≤𝑖≤𝑀A idx i​ ​ =B i​ ∀i,1≤i≤MOtherwise output "No". Note that the quotes are for clarity.InputThe first line contains a single integer, 𝑇T.𝑇T test cases follow where each test case contains four lines:The first line of a test case contains a single integer 𝑁NThe second line of the test case contains 𝑁N space separated integers, 𝐴1,𝐴2,...,𝐴𝑁A 1​ ,A 2​ ,...,A N​ The third line of the test case contains a single integer 𝑀M.The fourth line contains 𝑀M space separated integers, 𝐵1,𝐵2,...,𝐵𝑀B 1​ ,B 2​ ,...,B M​ Symbols have usual meanings as described in the statement.OutputFor each test case, output a single line containing the output. Output is "Yes" if Chef likes the sequence 𝐴A. Output is "No" if Chef dislikes the sequence 𝐴A.Constraints1≤𝑇≤1001≤T≤1001≤𝑁≤1031≤N≤10 3 1≤𝑀≤1031≤M≤10 3 1≤𝐴𝑖,𝐵𝑖≤1091≤A i​ ,B i​ ≤10 9 Sample Input3 6 1 2 3 4 5 6 3 2 3 4 6 22 5 6 33 1 4 2 4 15 4 1 3 4 2 2 1 2Sample OutputYes No YesExplanation:In sample test case 11, the sequence 1,2,3,4,5,61,2,3,4,5,6 contains the subsequence 2,3,42,3,4. The subsequence is present at indices 1,2,31,2,3 of the original sequence. Hence, 1,2,3,4,5,61,2,3,4,5,6 is a sequence which Chef likes it. Therefore, we output "Yes".In sample test case 22, the subsequence 4,154,15 is not present in sequence 22,5,6,33,1,422,5,6,33,1,4. Hence, we output "No".In sample test case 33, the sequence 1,3,4,21,3,4,2 contains the subsequence 1,21,2. The subsequence is present at indices 0,30,3. Therefore, we output "Yes".

Chef has an array 𝐴A of size 𝑁N. He wants to make a permutation†† using this array.Find whether there exists an array 𝐵B consisting of 𝑁N non-negative integers, such that the array 𝐶C constructed as 𝐶𝑖=𝐴𝑖+𝐵𝑖C i​ =A i​ +B i​ is a permutation.†† A permutation of size 𝑁N is an array of 𝑁N distinct elements in the range [1,𝑁][1,N]. For example, [4,2,1,3][4,2,1,3] is a permutation of size 44, while [3,2,2,1][3,2,2,1] and [1,3,4][1,3,4] are not.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of multiple lines of input.The first line of each test case consists of 𝑁N - the size of the array 𝐴AThe next line contains 𝑁N space-separated integers - 𝐴1,𝐴2,…,𝐴𝑁A 1​ ,A 2​ ,…,A N​ - the elements of array 𝐴A.Output FormatFor each test case, output YES if there exists an array 𝐵B such that array 𝐶C constructed as 𝐶𝑖=𝐴𝑖+𝐵𝑖C i​ =A i​ +B i​ is a permutation, otherwise 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).Constraints1≤𝑇≤1001≤T≤1001≤𝑁≤1001≤N≤1001≤𝐴𝑖≤𝑁1≤A i​ ≤NSample 1:InputOutput454 1 3 2 152 4 3 4 21161 1 1 1 6 6YESNOYESNOExplanation:Test case 11 : Consider 𝐵=[0,4,0,0,0]B=[0,4,0,0,0]. The corresponding array 𝐶C becomes [4,5,3,2,1][4,5,3,2,1], which is a permutation. Some other possible values of 𝐵B for which 𝐶C is a permutation are [1,0,1,1,1][1,0,1,1,1] and [1,3,0,0,0][1,3,0,0,0].Test case 22 : It can be proven that no valid array 𝐵B exists.

If you wanna party, if you, if you wanna partyThen put your hands upChef wants to host a party with a total of 𝑁N people.However, the party hall has a capacity of 𝑋X people. Find whether Chef can host the party.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of two space-separated integers 𝑁N and 𝑋X — the total number of people and the capacity of the party hall.Output FormatFor each test case, output on a new line, YES, if Chef can host the party and NO otherwise.Each character of the output may be printed in either uppercase or lowercase. That is, the strings NO, no, nO, and No will be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1001≤𝑁,𝑋≤101≤N,X≤10Sample 1:InputOutput42 54 36 610 9YESNOYESNOExplanation:Test case 11: Chef wants to host a party with 22 people. Since the capacity of the hall is 55, he can host the party.Test case 22: Chef wants to host a party with 44 people. Since the capacity of the hall is 33, he can not host the party.Test case 33: Chef wants to host a party with 66 people. Since the capacity of the hall is 66, he can host the party.Test case 44: Chef wants to host a party with 1010 people. Since the capacity of the hall is 99, he can not host the party.

Chef and Instant NoodlesChef has invented 11-minute Instant Noodles. As the name suggests, each packet takes exactly 11 minute to cook.Chef's restaurant has 𝑋X stoves and only 11 packet can be cooked in a single stove at any minute.How many customers can Chef serve in 𝑌Y minutes if each customer orders exactly 11 packet of noodles?Input FormatThe first and only line of input contains two space-separated integers 𝑋X and 𝑌Y — the number of stoves and the number of minutes, respectively.Output FormatPrint a single integer, the maximum number of customers Chef can serve in 𝑌Y minutesConstraints1≤𝑋,𝑌≤10001≤X,Y≤1000Sample 1:InputOutput3 721Explanation:Chef cooks for 𝑌=7Y=7 minutes and can cook 𝑋=3X=3 packets per minute, one on each stove.So, the total number of packets that can be cooked is 𝑋⋅𝑌=3⋅7=21X⋅Y=3⋅7=21.Each person orders one packet, so the maximum number of customers that can be served is 2121.

Chef has finally decided to complete all of his pending assignments.There are 𝑋X assignments where each assignment takes 𝑌Y minutes to complete.Find whether Chef would be able to complete all the assignments in 𝑍Z days.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists three space-separated integers 𝑋,𝑌,X,Y, and 𝑍Z — the number of assignments, time taken in minutes to complete each assignment, and the number of days in which Chef wants to complete the assignments.Output FormatFor each test case, output on a new line, YES, if Chef would be able to complete all the assignments in 𝑍Z days. Otherwise, print 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).Constraints1≤𝑇≤1051≤T≤10 5 1≤𝑋,𝑌≤1001≤X,Y≤1001≤𝑍≤101≤Z≤10Sample 1:InputOutput35 5 550 80 220 72 1YESNOYESExplanation:Test case 11: Chef needs a total of 5⋅5=255⋅5=25 minutes to complete all the assignments. Thus, he would be able to complete the assignments in 55 days.Test case 22: Chef needs a total of 50⋅80=400050⋅80=4000 minutes to complete all the assignments. However, in 22 days, he only has 2⋅24⋅60=28802⋅24⋅60=2880 minutes.Thus, he would not be able to complete the assignments in 22 days.Test case 33: Chef needs a total of 20⋅72=144020⋅72=1440 minutes to complete all the assignments. In 11 days, he has 24⋅60=144024⋅60=1440 minutes.Thus, he would be able to complete the assignments in 11 day.