#include <bits/stdc++.h>
using namespace std;
long long nCr(long long n, long long r) {
  vector<vector<long long> > ans(n + 1);
  ans[0].push_back(1);
  ans[1].push_back(1);
  ans[1].push_back(1);
  for (int i = 2; i <= n; i++) {
    ans[i].push_back(1);
    for (int j = 1; j < ans[i - 1].size(); j++) {
      ans[i].push_back((ans[i - 1][j - 1] + ans[i - 1][j]));
    }
    ans[i].push_back(1);
  }
  return ans[n][r];
}
int isp(string s) {
  int l = 0;
  int h = s.size() - 1;
  while (h > l) {
    if (s[l++] != s[h--]) {
      return 0;
    }
  }
  return 1;
}
int rev(string s, string p) {
  int i;
  for (i = 0; i < s.size(); i++) {
    if (s[i] != p[s.size() - 1 - i]) return 0;
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int i, j, t;
  cin >> t;
  while (t--) {
    int x, n, m;
    cin >> x >> n >> m;
    int flag = 0;
    while (1) {
      if (x <= 0) {
        flag = 1;
        break;
      }
      if (n == 0 && m == 0) break;
      if (n > 0) {
        n--;
        x = min(x / 2 + 10, x);
      } else if (m > 0) {
        m--;
        x = x - 10;
      }
    }
    if (flag == 1)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
