#include <bits/stdc++.h>
using namespace std;
void solve(){
long long s, k, m;
cin >> s >> k >> m;
long long modulo = m % k;
if ((m/k)%2 == 0){
if (s > modulo) cout << s - modulo << '\n';
else cout << 0 << '\n';
}else{
if (min(k, s) > modulo) cout << min(k, s) - modulo << '\n';
else cout << 0 << '\n';
}
}
int main(){
long long tc; cin >> tc; while(tc--)solve();
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCl7CiAgICBsb25nIGxvbmcgcywgaywgbTsKICAgIGNpbiA+PiBzID4+IGsgPj4gbTsKCiAgICBsb25nIGxvbmcgbW9kdWxvID0gbSAlIGs7CiAgICBpZiAoKG0vayklMiA9PSAwKXsKICAgICAgICBpZiAocyA+IG1vZHVsbykgY291dCA8PCBzIC0gbW9kdWxvIDw8ICdcbic7CiAgICAgICAgZWxzZSBjb3V0IDw8IDAgPDwgJ1xuJzsKICAgIH1lbHNlewogICAgICAgIGlmIChtaW4oaywgcykgPiBtb2R1bG8pIGNvdXQgPDwgbWluKGssIHMpIC0gbW9kdWxvIDw8ICdcbic7CiAgICAgICAgZWxzZSBjb3V0IDw8IDAgPDwgJ1xuJzsKICAgIH0KfQoKaW50IG1haW4oKXsKICAgIGxvbmcgbG9uZyB0YzsgY2luID4+IHRjOyB3aGlsZSh0Yy0tKXNvbHZlKCk7Cn0=