#include <iostream>		//cin, cout
#include <vector>		//vector
#include <algorithm>	//sort,min,max,count

using namespace std;

int main() {

	int T, N, M, K;
	cin >> T;

	for (int i = 0; i < T; i++) {
		cin >> N >> M >> K;

		vector<int> a(N + 1);
		a[0] = K % M;
		for (int j = 1; j <= N; j++) {
			if ((M - j) > a[j - 1]) {
				a[j] = a[j - 1];
			}
			else if ((M - j) == a[j - 1]) {
				a[N] = 0;
				break;
			}
			else {
				a[j] = a[j - 1] % (M - j);
			}
		}
		cout << a[N] << endl;
	}

	return 0;

}