// clang-format off
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <bitset>
#include <vector>
#include <algorithm>
#include <random>
#include <map>
#include <string>
#include <set>
#include <deque>
#include <cassert>


const int N = 2e5 + 7, A = 26, C = 2, MOD = 998244353;
const long long INF = 1e18;
using namespace std;
using ll = long long;
using ld = long double;

const ld EPS = 1e-9;

long long abr, ban, yabl, gr;

long long check(ll sets) {
    ll a = abr - sets;
    ll b = ban - sets;
    ll y = yabl - sets * 2;
    ll sets2 = min(b, y);
    sets2 += (y - sets2) / 2;
    return sets + min(a / 2, sets2);
}

void solve() {
    cin >> abr >> ban >> yabl >> gr;
    ll max_sets = gr;
    max_sets = min(gr, abr);
    max_sets = min(max_sets, yabl / 2);
    max_sets = min(max_sets, ban);
    ll ans = max(check(0), check(max_sets));
    /*for (int sets = 0; sets <= max_sets; sets++) {
        cout << check(sets) << " ";
        ans = max(ans, check(sets));
    }*/

    int L = 0, R = max_sets;

    for (int i = 0; i < 100; i++) {
        int i1 = L + (R - L) / 3;
        int i2 = R - (R - L) / 3;
        if (check(i1) < check(i2)) {
            L = i1;
        }
        else {
            R = i2;
        }
    }

    for (int sets = L; sets <= R; sets++) {
        ans = max(ans, check(sets));
    }

    cout << ans << "\n";
}

signed main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
#else
    std::ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}