#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, m, k;
        cin >> n >> m >> k;
        if (n > m) swap(n, m);
        int ans = 1e9;
        if (m * 2 < k){
            ans = 4;
        }
        else if (n * 2 < k){
            ans = 2;
            int t = m - (k - n);
            if (t < 0) t = m;
            if (t == 0){
                ans += 0;
            }
            else if (t * 2 < k){
                ans += 2;
            }
            else{
                ans += (2 * t + k - 1) / k;
            }
        }
        else if (m < k){
            vector<int> p{n, n, m, m};
            do{
                int t = 0;
                int remain = 0;
                for(auto x : p){
                    if (remain > x){
                        t += 1;
                        remain = k - x;
                    }
                    else if (remain == x){
                        remain = 0;
                    }
                    else{
                        t += 1;
                        remain = remain + k - x;
                    }
                }
                ans = min(ans, t);
            }while(next_permutation(p.begin(), p.end()));
        }
        else{
            ans = (2 * (n + m) + k - 1) / k;
        }
        if (m < k and (k - m) * 2 == n){
            ans = min(ans, 3);
        }
        if (n < k and (k - n) * 2 == m){
            ans = min(ans, 3);
        }
        cout << ans << '\n';
    }

}