#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)

void slove(){
  int n,m,k;
  cin >> n >> m >> k;
  k %= m;
  if (m-n <= k) cout << 0 << endl;
  else cout << k << endl;
  return;
}

int main(){
  int tt = 1;
  cin >> tt;
  while(tt--){
   slove();
  }
  //cout << f(10,10) << endl;
  return 0;
}