#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
template <class T>
void chmin(T &a, const T &b) {
    if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
    if (a < b) a = b;
}

void solve() {
    ll A, B, C;
    cin >> A >> B >> C;

    ll ans = 0;
    ans += 2 * (B / 2);
    B %= 2;
    ll tmp = min(A, C);
    ans += 2 * tmp;
    A -= tmp;
    C -= tmp;

    if (B > 0 && A > 0) {
        A--;
        B--;
        ans++;
    }
    ans += C / 2;

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

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int T;
    cin >> T;
    rep(i, T) solve();

    return 0;
}