#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigMod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline T diss(T x1, T x2, T y1, T y2) {
  return sqrt(((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)));
}
template <class T>
inline T disss(T x1, T x2, T z1, T y1, T y2, T z2) {
  return sqrt(((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)) +
              ((z1 - z2) * (z1 - z2)));
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
template <class T>
inline T string2int(string a) {
  stringstream str(a);
  T b;
  str >> b;
  return b;
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
bool is_prime(long long n) {
  if (n == 1) return false;
  for (long long i = 2; (i * i) <= n; i++)
    if (n % i == 0) return false;
  return true;
}
int main() {
  long long t;
  scanf("%lld", &t);
  while (t--) {
    long long a, b, c;
    scanf("%lld %lld %lld", &a, &b, &c);
    long long ans = 0;
    int dv = c / 2;
    if (dv <= b) {
      ans += (dv * 2);
      ans += dv;
      b -= dv;
    }
    dv = b / 2;
    if (dv <= a) {
      ans += (dv * 2);
      ans += dv;
    }
    cout << ans << endl;
  }
  return 0;
}
