#include <iostream>
#define ll long long
using namespace std;

void solve() {
    ll n, m, k;
    cin >> n >> m >> k;

    ll l = 1, r = m, ans = m;

    while (l <= r) {
        ll mid = (l + r) / 2;

        ll full = m / (mid + 1);
        ll mod = m % (mid + 1);

        ll row = full * mid + min(mod, mid);

        if (row * n >= k) {
            ans = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }

    cout << ans << endl;
}

int main() {
    ll t;
    cin >> t;
    while (t--) solve();
}