Problem: Kana was just an ordinary high school girl before a talent scout discovered her. Then, she became an idol. But different from the stereotype, she is also a gameholic. 

One day Kana gets interested in a new adventure game called Dragon Quest. In this game, her quest is to beat a dragon.

<image>

The dragon has a hit point of x initially. When its hit point goes to 0 or under 0, it will be defeated. In order to defeat the dragon, Kana can cast the two following types of spells. 

  * Void Absorption

Assume that the dragon's current hit point is h, after casting this spell its hit point will become \left⌊ h/2 \right⌋ + 10. Here \left⌊ h/2 \right⌋ denotes h divided by two, rounded down.

  * Lightning Strike

This spell will decrease the dragon's hit point by 10. Assume that the dragon's current hit point is h, after casting this spell its hit point will be lowered to h-10.




Due to some reasons Kana can only cast no more than n Void Absorptions and m Lightning Strikes. She can cast the spells in any order and doesn't have to cast all the spells. Kana isn't good at math, so you are going to help her to find out whether it is possible to defeat the dragon.

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.

The next t lines describe test cases. For each test case the only line contains three integers x, n, m (1≤ x ≤ 10^5, 0≤ n,m≤30) — the dragon's intitial hit point, the maximum number of Void Absorptions and Lightning Strikes Kana can cast respectively.

Output

If it is possible to defeat the dragon, print "YES" (without quotes). Otherwise, print "NO" (without quotes).

You can print each letter in any case (upper or lower).

Example

Input


7
100 3 4
189 3 4
64 2 3
63 2 3
30 27 7
10 9 1
69117 21 2


Output


YES
NO
NO
YES
YES
YES
YES

Note

One possible casting sequence of the first test case is shown below:

  * Void Absorption \left⌊ 100/2 \right⌋ + 10=60.
  * Lightning Strike 60-10=50.
  * Void Absorption \left⌊ 50/2 \right⌋ + 10=35.
  * Void Absorption \left⌊ 35/2 \right⌋ + 10=27.
  * Lightning Strike 27-10=17.
  * Lightning Strike 17-10=7.
  * Lightning Strike 7-10=-3.

Solution (in PYTHON3):

Solution:
t = int(input())
for _ in range(t):
    x, n, m = map(int, input().split())
    h = x
    i = 0
    while h // 2 + 10 < h and i < n:
        h = h // 2 + 10
        i += 1
    h -= 10 * m
    if h <= 0:
        print('YES')
        continue

    print('NO')



# import sys
#
# sys.setrecursionlimit(10 ** 6)
#
# n, k = map(int, input().split())
# graph = [[] for _ in range(n)]
# for _ in range(n - 1):
#     u, v = map(int, input().split())
#     u -= 1
#     v -= 1
#     graph[u].append(v)
#     graph[v].append(u)
#
# subtree = [[0, 0, i] for i in range(len(graph))]
#
#
# def dfs1(vert: int, prev: int, depth=0):
#     cnt = 0
#     for to in graph[vert]:
#         if to != prev:
#             cnt += dfs1(to, vert, depth + 1)
#     subtree[vert][0] = cnt
#     subtree[vert][1] = -depth
#     return cnt + 1
#
#
# dfs1(0, -1)
# tourist = [0] * len(graph)
#
# for u in sorted(subtree, reverse=True)[:len(graph) - k]:
#     tourist[u[2]] = 1
#
# # print(tourist)
# # print([sorted(subtree, reverse=True)])
#
# answer = 0
#
#
# def dfs2(vert: int, prev: int):
#     global answer
#     cnt = 0
#     for to in graph[vert]:
#         if to != prev:
#             cnt += dfs2(to, vert)
#     if tourist[vert] == 1:
#         answer += cnt
#     return cnt + (1 - tourist[vert])
#
#
#
# dfs2(0, -1)
# print(answer)
#
# # dist[0] = 0
# # queue = deque((0,))
# # row = {}
# # while len(queue) > 0:
# #     cur = queue.popleft()
# #     if len(graph[cur]) == 1:
# #         row[0] = 1 + (row[0] if 0 in row else 0)
# #     else:
# #
# #     for to in graph[cur]:
# #         if dist[to] == INF:
# #             dist[to] = dist[cur] + 1
# #             queue.append(to)
# # print(sum(sorted(dist, reverse=True)[:k]))