#include <bits/stdc++.h>
using namespace std;
int t;
long long n, k, d1, d2;
int f[] = {1, -1};
int main() {
  cin >> t;
  while (t--) {
    cin >> n >> k >> d1 >> d2;
    long long rem = n - k;
    long long t1 = 100 * n;
    int flag = 0;
    for (int i = 0; i < 2; ++i) {
      long long t2 = t1 + f[i] * d1;
      for (int j = 0; j < 2; ++j) {
        long long t3 = t2 + f[j] * d2;
        long long w[3];
        w[0] = t1;
        w[1] = t2;
        w[2] = t3;
        sort(w, w + 3);
        long long need = w[2] - w[0] + w[2] - w[1];
        long long now = w[2] - w[0] + w[1] - w[0];
        if (now <= k && (k - now) % 3 == 0 && need <= rem &&
            (rem - need) % 3 == 0) {
          flag = 1;
        }
      }
    }
    if (flag)
      cout << "yes" << endl;
    else
      cout << "no" << endl;
  }
  return 0;
}
