#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=200010;
const int MAX=1000000100;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int d[5];
int pd(int a,int b,int c,int g) {int i,k=0;d[++k]=min(c,g);d[++k]=min(a-g,g);d[++k]=min(b-g,g);sort(d+1,d+k+1);return d[1]+d[2]+min(d[1]+d[2]+1,d[3])>=g;
}
int main()
{int a,b,c,t;scanf("%d", &t);while (t--) {scanf("%d%d%d", &a, &b, &c);int l=-1,r=b+1,mid=(l+r)>>1;while (l+1<r)if (pd(a,b,c,mid)) { l=mid;mid=(l+r)>>1; }else { r=mid;mid=(l+r)>>1; }printf("%d\n", l);}return 0;
}