#include <bits/stdc++.h>
using namespace std;

#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

bool can(ll a, ll b, ll c, ll sum) {
    return a == sum || b == sum || c == sum || 
            a+b == sum || a+c == sum || b+c == sum ||
                a+b+c == sum;
}

ll solve(ll w, ll h, ll s) {
    if(max(w, h) >= s) {
        return (w + w + h + h + s - 1) / s;
    } 
    if(w + h == s) {
        return 2;
    }
    if(w + w + h + h > 3*s) {
        return 4;
    }
    if(w + w + h + h == 3*s) {
        return 3;
    }
    if(w + w == s || h + h == s) {
        return 3;
    }
    //w, h < s and 2*(w+h) < 3*s
    /*
    5 segments max, 3 sides are covered by 1, but they can't be from same line
    */
    if(can(s-w, s-w, s-h, h) || can(s-h, s-h, s-w, w))
        return 3;
    return 4;
}
int main() {
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    int T;
    cin >> T;
    while(T--) {
        ll w, h, s;
        cin >> w >> h >> s;
        cout << solve(w, h, s) << '\n';
    }
}