#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

#define int ll
void solve()
{
    int a, b, s;
    cin >> a >> b >> s;
    if (a < b)
        swap(a, b);
    int ans = -1;
    auto make = [](int x, int y)
    {
        return (x + y - 1) / y;
    };
    if (s <= b)
        ans = make(2 * (a + b), s);
    else if (a >= s && s > b)
    {
        if (2 * a + b >= 2 * s)
            ans = make(2 * (a + b), s);
        else if (2 * (a + b) == 3 * s)
            ans = 3;
        else
            ans = 4;
    }
    else
    {
        if (a + b == s)
            ans = 2;
        else if (2 * b == s || 2 * a == s || 2 * (a + b) == 3 * s || 2 * a + b == 2 * s || a + 2 * b == 2 * s)
            ans = 3;
        else
            ans = 4;
    }

    assert(ans != -1);
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}