Pussit

#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;

bool ok(ll n, ll m, ll t){
	ll mel = (n-1)*t;
	if(m-mel < t)
		return false;
	return true;
}
ll hae(ll n, ll m, ll k){
	if(m < n){
		ll re = n-m+k;
		return re;
	}
	ll su = 0;
	ll a = 0, b = 1500000000;
	unordered_set<ll> kk;
	while(a < b){
		ll mid = (a+b)/2;
		if(kk.count(mid)){
			break;
		}
		kk.insert(mid);
				
		if(!ok(n, m, mid)){
			b = mid-1;
		}
		else{
			a = mid;
		}
	}
	su = (a+b)/2;
	if(ok(n, m, su+1))
		su++;
	//cout << "su " << su << endl;
 	if((k-su*n) <= 0){
		return k;
				
	}
	else{
		ll jal = m-su*n;

		return  k+n-jal;
	}
}
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	int t; cin >> t;
	while(t--){
		ll n, m, k;
		cin >> n >> m >> k;
		cout << hae(n, m, k) << endl;
	}
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER