#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
  return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
  return ((a) / gcd((a), (b)) * (b));
}
template <class T>
inline T BigMod(T Base, T power, T M = 1000000007) {
  if (power == 0) return 1;
  if (power & 1)
    return ((Base % M) * (BigMod(Base, power - 1, M) % M)) % M;
  else {
    T y = BigMod(Base, power / 2, M) % M;
    return (y * y) % M;
  }
}
template <class T>
inline T ModInv(T A, T M = 1000000007) {
  return BigMod(A, M - 2, M);
}
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k, d1, d2;
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> k >> d1 >> d2;
    long long x = max(d1, d2);
    if (x > n / 3 || n % 3 != 0) {
      cout << "no" << endl;
      continue;
    }
    x += abs(d1 - d2);
    if (n - x - k >= 0 && (n - x - k) % 3 == 0 &&
        max(d1, d2) + (n - x - k) / 3 <= n / 3) {
      cout << "yes" << endl;
      continue;
    }
    x = d1 + d2 + d1;
    if (n - x - k >= 0 && (n - x - k) % 3 == 0 &&
        (d1 + d2 + (n - x - k) / 3) <= n / 3) {
      cout << "yes" << endl;
      continue;
    }
    x = d1 + d2;
    if (n - x - k >= 0 && (n - x - k) % 3 == 0 &&
        max(d1, d2) + (n - x - k) / 3 <= n / 3) {
      cout << "yes" << endl;
      continue;
    }
    x = d1 + d2 + d2;
    if (n - x - k >= 0 && (n - x - k) % 3 == 0 &&
        (d1 + d2 + (n - x - k) / 3) <= n / 3) {
      cout << "yes" << endl;
      continue;
    }
    cout << "no" << endl;
  }
  return 0;
}
