B. GCD Arrays

Consider the array aa composed of all the integers in the range [l,r][l,r]. For example, if l=3l=3 and r=7r=7, then a=[3,4,5,6,7]a=[3,4,5,6,7].

Given ll, rr, and kk, is it possible for gcd(a)gcd(a) to be greater than 11 after doing the following operation at most kk times?

• Choose 2 numbers from a.
• Permanently remove one occurrence of each of them from the array.
• Insert their product back into a.

gcd(b)gcd(b) denotes the greatest common divisor (GCD) of the integers in bb.

Input

The first line of the input contains a single integer tt (1≤t≤1051≤t≤105) — the number of test cases. The description of test cases follows.

The input for each test case consists of a single line containing 33 non-negative integers ll, rr, and kk (1≤l≤r≤109,0≤k≤r−l1≤l≤r≤109,0≤k≤r−l).