Pussit

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <iomanip>

#define uint unsigned int
#define INF 999999999
#define ll long long
#define M 1000000007
#define E 0.0000001
#define N 1024

using namespace std;

int main()
{
    int t;
    cin>>t;
    for (int i = 0; i < t; i++) {
        int n, m, k;
        cin>>n>>m>>k;
        /*int ans2 = INF;
        if (k <= n) ans2 = n - min(m, n) + k;
        for (int i = n - 1; i > 0; i--) {
            int h = m / i;
            int l = m - (h * i);
            if (l >= h) continue;
            if (l > 0 && i == n) continue;
            int tans = 0;
            if (l * (i + 1) >= k) {
                tans = k + (n - i) - 1;
            } else if (l) {
                tans = k + (n - i);
            } else {
                tans = k + (n - i);
            }
            //cout<<"i: "<<i<<" h: "<<h<<" l: "<<l<<" ans: "<<tans<<endl;
            ans = min(ans, tans);
            //break;
        }*/

        if ((k / n + (k % n == 0 ? 0 : 1)) * n <= m) cout<<k<<endl;
        else {
            int ans = n;
            int mx = -1;
            while (ans > mx) {
                //cout<<m % ans<<" "<<(n * (m / ans) - (ans * (m / ans)))<<endl;
                if (m % ans <= (n * (m / ans) - (ans * (m / ans)))) mx = max(mx, ans);
                else mx = max(mx, m % ans);
                //cout<<"mx"<<mx<<endl;
                ans--;
            }
            cout<<n - mx + k<<endl;
        }
    }

    return 0;
}

/**
2 5 5

1 1 1
*
= 1

2 1 1
*-
= 2

2 2 2
**
= 2

2 3 3
*-
**
= 4

3 4 3
*--
***
= 3

3 4 4
**-
**-

5 7 7
-----
-----
-***-
-****
= 9

5 6 6
--***
--***
= 8

10 16 16
----------
----------
--********
--********
= 18

4 9 9
-***
-***
-***

4 14 14
----
-***
-***
****
****
= 15

4 14 13
= 14

5 6 6
-----
-----
-----
= 8

5 7 6
-----
--***
-****
= 8
*/

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED