#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();
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojZGVmaW5lIGxsIGxvbmcgbG9uZwp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBzb2x2ZSgpIHsKICAgIGxsIG4sIG0sIGs7CiAgICBjaW4gPj4gbiA+PiBtID4+IGs7CgogICAgbGwgbCA9IDEsIHIgPSBtLCBhbnMgPSBtOwoKICAgIHdoaWxlIChsIDw9IHIpIHsKICAgICAgICBsbCBtaWQgPSAobCArIHIpIC8gMjsKCiAgICAgICAgbGwgZnVsbCA9IG0gLyAobWlkICsgMSk7CiAgICAgICAgbGwgbW9kID0gbSAlIChtaWQgKyAxKTsKCiAgICAgICAgbGwgcm93ID0gZnVsbCAqIG1pZCArIG1pbihtb2QsIG1pZCk7CgogICAgICAgIGlmIChyb3cgKiBuID49IGspIHsKICAgICAgICAgICAgYW5zID0gbWlkOwogICAgICAgICAgICByID0gbWlkIC0gMTsKICAgICAgICB9IGVsc2UgewogICAgICAgICAgICBsID0gbWlkICsgMTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBhbnMgPDwgZW5kbDsKfQoKaW50IG1haW4oKSB7CiAgICBsbCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwp9

NQozIDQgNwo1IDUgNQoxIDEzIDIKMiA0IDcKMSA1IDQK

5
3 4 7
5 5 5
1 13 2
2 4 7
1 5 4