#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)

using namespace std;

void solve(){
    int N, M, K;
    cin >> N >> M >> K;
    int r = K % M;
    if(r >= M - N) cout << 0 << endl;
    else cout << r << endl;
}

int main(){
    int T;
    cin >> T;
    while(T--){
        solve();
    }
    
    return 0;
}