func_code_string: #include <bits/stdc++.h>   using namespace std;   const int inf = 0x3f3f3f3f;   const int mod = 10007;   const long long INF = 1e18 + 1234;   int setbit(int n, int pos) { return n = n | (1 << pos); }   int resetbit(int n, int pos) { return n = n & ~(1 << pos); }   bool checkbit(int n, int pos) { return (bool)(n & (1 << pos)); }   template <typename T>   T mul(T x, T y) {     x %= mod;     y %= mod;     return (x * y) % mod;   }   template <typename T>   T add(T x, T y) {     x %= mod;     y %= mod;     return (x + y) % mod;   }   template <typename T>   T modPow(T x, T k, T mod) {     if (k == 0) return 1;     if (k & 1) {       return ((x % mod) * modPow(x, k - 1, mod) % mod) % mod;     } else {       T ret = modPow(x, k / 2, mod);       ret %= mod;       return (ret * ret) % mod;     }   }   template <typename T>   T ext_gcd(T num1, T num2, T& X, T& Y) {     T r2, r1, q2, q1, x2, x1, y2, y1, x, y, r;     x2 = 1;     y2 = 0;     x1 = 0;     y1 = 1;     for (r2 = num1, r1 = num2; r1 != 0;          y2 = y1, y1 = y, x2 = x1, x1 = x, r2 = r1, r1 = r) {       q1 = r2 / r1;       x = x2 - q1 * x1;       y = y2 - q1 * y1;       r = r2 % r1;     }     X = x2;     Y = y2;     return r2;   }   template <typename T>   void print(const T& v) {     cerr << v <<    ;   }   template <typename T1, typename... T2>   void print(const T1& first, const T2&... rest) {     print(first);     print(rest...);   }   template <class T>   string to_str(T t) {     stringstream second;     second << t;     return second.str();   }   template <typename T>   T modInv(T x, T m) {     return modPow(x, m - 2, m);   }   template <typename T>   void dbg_a(T a[], int n = 10) {     cerr <<  [  ;     for (int i = 0; i < n; i++) cerr << a[i] <<    ;     cerr <<   ]           <<   n ;   }   template <typename F, typename S>   ostream& operator<<(ostream& os, const pair<F, S>& p) {     return os <<  [   << p.first <<  ,   << p.second <<   ] ;   }   template <typename T>   ostream& operator<<(ostream& os, const vector<T>& v) {     os <<  [  ;     for (int i = 0; i < v.size(); i++) os << v[i] <<    ;     return os <<   ] n ;   }   const int M = (int)1e6 + 123;   const int maxn = (int)1e6;   bool check(int x, int c, int m) {     int k = min(m, c);     c -= x;     m -= x;     if (c + m >= x)       return 1;     else       return 0;   }   void solve() {     int x = 2048, y, z, k, ans = 0, c, m;     cin >> c >> m >> x;     k = min(c, min(m, x));     ans = k;     c -= k;     m -= k;     x -= k;     if (c == 0 or m == 0) {       cout << ans <<   n ;       return;     }     int s = 0, e = min(c, m), mid;     int ret = 0;     while (s <= e) {       mid = s + (e - s) / 2;       if (check(mid, c, m)) {         ret = mid;         s = mid + 1;       } else {         e = mid - 1;       }     }     cout << ans + ret <<   n ;   }   int main() {     ios ::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     long long t = 1, c = 0;     cin >> t;     while (t--) {       solve();     }     return 0;   }   