#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define vt vector
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef ONLINE_JUDGE
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define MULTIPLE_CASES


const int INF = 1e9 +7;
const ll LLINF = 1e18 +5;

int i4[4] = {1,0,-1,0};
int j4[4] = {0,1,0,-1};

template<typename T, typename U>
void umax(T& a, U b) {a=a<b?b:a;}

template<typename T, typename U>
void umin(T& a, U b) {a=a>b?b:a;}


void solve()
{
    int w,h,n;
    cin >> w >> h >> n;
    int cnt = 1;
    while(w && h)
    {
        bool ch = 0;
        if(w%2==0)
        {
            w /= 2;
            cnt *= 2;
            ch = 1;
        }
        if(h % 2 == 0)
        {
            h /= 2;
            cnt *= 2;
            ch = 1;
        }
        if(!ch) break;
    }
    cout << (cnt >= n ? "YES" : "NO") << "\n";

}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef MULTIPLE_CASES
    int cases;
    cin >> cases;
    for(int i = 1; i <= cases;i++)
    {
        solve();
    }
    #else
    solve();
    #endif
    return 0;
}
