#include <atcoder/modint>

using mint = atcoder::modint998244353;
using ll = long long;

#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>

int main() {

  int T;
  std::cin >> T;
  for (int cc = 0; cc < T; cc++) {
    ll A, B, C;
    std::cin >> A >> B >> C;
    ll ans = 0;
    {
      ll m = std::min(A, C);
      ans += 2 * m;
      A -= m;
      C -= m;
    }
    if (A == 0) {
      ans += 2 * (B / 2);
      ans += C / 2;
    }
    else {
      ans += B;
    }
    std::cout << ans << "\n";
  }

  return 0;
}