#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using ld = long double;
const int mod = 1000000007;
const int hnum = 998244353;
const ld PI = acos(-1);
long long qpow(long long x, long long powcnt, long long tomod) {
  long long res = 1;
  for (; powcnt; powcnt >>= 1, x = (x * x) % tomod)
    if (1 & powcnt) res = (res * x) % tomod;
  return (res % tomod);
}
long long inv(long long x) { return qpow(x, mod - 2, mod); }
long long x, a, b;
void solve() {
  cin >> x >> a >> b;
  if (x <= 10 * b) {
    cout << "Yes\n";
    return;
  }
  while (x && a) {
    x = x / 2 + 10;
    a--;
    if (x <= 10 * b) {
      cout << "Yes\n";
      return;
    }
  }
  cout << "No\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
