#include <bits/stdc++.h>
using namespace std;
 
// Speed
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
 
// Typedefs
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define endl '\n'
 
// Loops
#define rep(i,a,b) for(int i=a;i<b;++i)
#define each(x, a) for (auto &x : a)
 
int distinct_count(vector<int> &v) {
    unordered_set<int> st(all(v));
    return st.size();
}
 
// Logic
void solve() {
    int n;
    cin>>n;
   int y,r;
   cin>>y>>r;
   int d;
   d=y/2 +r;
   if(d>n) cout<<n<<endl;
   else cout<<d<<endl;
}
 
 
// Main
int32_t main() {
    fast_io;
    int t;
    cin>>t;
    while (t--) solve();
    return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyBTcGVlZAojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7IGNvdXQudGllKDApCgovLyBUeXBlZGVmcwojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBmZiBmaXJzdAojZGVmaW5lIHNzIHNlY29uZAojZGVmaW5lIGFsbCh4KSAoeCkuYmVnaW4oKSwgKHgpLmVuZCgpCiNkZWZpbmUgcmFsbCh4KSAoeCkucmJlZ2luKCksICh4KS5yZW5kKCkKI2RlZmluZSBzeih4KSAoKGludCkoeCkuc2l6ZSgpKQojZGVmaW5lIGVuZGwgJ1xuJwoKLy8gTG9vcHMKI2RlZmluZSByZXAoaSxhLGIpIGZvcihpbnQgaT1hO2k8YjsrK2kpCiNkZWZpbmUgZWFjaCh4LCBhKSBmb3IgKGF1dG8gJnggOiBhKQoKaW50IGRpc3RpbmN0X2NvdW50KHZlY3RvcjxpbnQ+ICZ2KSB7CiAgICB1bm9yZGVyZWRfc2V0PGludD4gc3QoYWxsKHYpKTsKICAgIHJldHVybiBzdC5zaXplKCk7Cn0KCi8vIExvZ2ljCnZvaWQgc29sdmUoKSB7CiAgICBpbnQgbjsKICAgIGNpbj4+bjsKICAgaW50IHkscjsKICAgY2luPj55Pj5yOwogICBpbnQgZDsKICAgZD15LzIgK3I7CiAgIGlmKGQ+bikgY291dDw8bjw8ZW5kbDsKICAgZWxzZSBjb3V0PDxkPDxlbmRsOwp9CgoKLy8gTWFpbgppbnQzMl90IG1haW4oKSB7CiAgICBmYXN0X2lvOwogICAgaW50IHQ7CiAgICBjaW4+PnQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K

NQozCjEgMgoyCjAgMAo0CjYgMAozCjMgMwoxMAoxMSA1Cg==

5
3
1 2
2
0 0
4
6 0
3
3 3
10
11 5