func_code_string: #include <bits/stdc++.h>   using namespace std;   void canhazfast() {     ios_base::sync_with_stdio(false);     cin.tie(nullptr);     cout.tie(nullptr);   }   template <typename T>   T gcd(T a, T b) {     return b ? gcd(b, a % b) : a;   }   template <typename T>   T extgcd(T a, T b, T &x, T &y) {     T x0 = 1, y0 = 0, x1 = 0, y1 = 1;     while (b) {       T q = a / b;       a %= b;       swap(a, b);       x0 -= q * x1;       swap(x0, x1);       y0 -= q * y1;       swap(y0, y1);     }     x = x0;     y = y0;     return a;   }   int ctz(unsigned x) { return __builtin_ctz(x); }   int ctzll(unsigned long long x) { return __builtin_ctzll(x); }   int clz(unsigned x) { return __builtin_clz(x); }   int clzll(unsigned long long x) { return __builtin_clzll(x); }   int popcnt(unsigned x) { return __builtin_popcount(x); }   int popcntll(unsigned long long x) { return __builtin_popcountll(x); }   int bsr(unsigned x) { return 31 ^ clz(x); }   int bsrll(unsigned long long x) { return 63 ^ clzll(x); }   void solve() {     int st, in, ex, ans;     int lo;     cin >> st >> in >> ex;     lo = (ex + in - st) >> 1;     lo = min(max(lo + 1, 0), ex + 1);     ans = ex - lo + 1;     cout << ans <<   n ;   }   int main() {     canhazfast();     int t;     cin >> t;     for (; t; --t) solve();     return 0;   }   