#include <bits/stdc++.h>
#pragma comment(linker, "/stack:225450978")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long Mod = 1000000007LL, INF = 1e9, LINF = 1e18;
const long double Pi = 3.141592653589793116, EPS = 1e-9,
                  Gold = ((1 + sqrt(5)) / 2);
long long keymod[] = {1000000007LL, 1000000009LL, 1000000021LL, 1000000033LL};
long long keyCount = sizeof(keymod) / sizeof(long long);
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcountll(s);
}
auto TimeStart = chrono::steady_clock::now();
auto TimeEnd = chrono::steady_clock::now();
void ControlIO(int argc, char* argv[]);
void TimerStart();
void TimerStop();
void Exit();
long long n, k, d1, d2;
void Input() { cin >> n >> k >> d1 >> d2; }
void Solve() {
  long long A = LINF, B = 0, C = 0;
  for (long long i = 0; i < 2; i++) {
    for (long long j = 0; j < 2; j++) {
      if (i)
        B = A - d1;
      else
        B = A + d1;
      if (j)
        C = B - d2;
      else
        C = B + d2;
      if ((k - A - B - C + min(A, min(B, C)) * 3) % 3 != 0 ||
          k - A - B - C + min(A, min(B, C)) * 3 < 0)
        continue;
      if ((A + B + C + n - k) % 3 == 0 &&
          (A + B + C + n - k) / 3 >= max(A, max(B, C))) {
        cout << "yes\n";
        return;
      }
    }
  }
  cout << "no\n";
}
int main(int argc, char* argv[]) {
  ControlIO(argc, argv);
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int T;
  cin >> T;
  TimerStart();
  while (T--) {
    Input();
    Solve();
  }
  TimerStop();
  return 0;
}
void ControlIO(int argc, char* argv[]) {}
void TimerStart() {}
void TimerStop() {}
void Exit() {
  TimerStop();
  exit(0);
}
