#include <bits/stdc++.h>
using namespace std;
long long MOD = (long long)1000000007;
long long gcd(long long a, long long b) { return (!b ? a : gcd(b, a % b)); }
int gcd(int a, int b) { return (!b ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int pc(long long x) { return __builtin_popcount(x); }
int lsf(long long x) { return x ^ (x & (x - 1)); }
void prv(vector<int> vec) {
  for (auto v : vec) cout << v << " ";
}
long long exGcd(long long a, long long b, long long &x, long long &y) {
  if (a < 0) {
    long long r = exGcd(-a, b, x, y);
    x *= -1;
    return r;
  }
  if (b < 0) {
    long long r = exGcd(a, -b, x, y);
    y *= -1;
    return r;
  }
  if (!b) {
    x = 1, y = 0;
    return a;
  }
  long long prevX, prevY;
  long long gcd = exGcd(b, a % b, prevX, prevY);
  x = prevY;
  y = prevX - a / b * prevY;
  return gcd;
}
bool cmp(const pair<char, int> &a, const pair<char, int> &b) {
  return (a != b ? a < b : a.second < b.second);
}
bool sameParity(long long a, long long b) { return (a % 2 == b % 2); }
vector<int> ModMulInvRange(int p) {
  vector<int> inv(p - 1, 1);
  for (int i = 2; i < p; ++i) inv[i] = (p - (p / i) * inv[p % i] % p) % p;
  return inv;
}
long long pow(long long a, long long k, long long m) {
  if (!k) return 1;
  long long res = pow(a, k >> 1, m);
  res = (res * res) % m;
  if (k & 1) res = (res * a) % m;
  return res % m;
}
long long phi(long long m) {
  int count = 0;
  long long p, res = 1, nn = m;
  while (!(nn % 2)) ++count, nn >>= 1;
  if (count) res *= (1 << (count - 1));
  for (long long i = 3; i * i <= m; i += 2) {
    p = 1;
    while (!(nn % i)) nn /= i, p *= i;
    if (p != 1) res *= (p / i * (i - 1));
  }
  if (nn != 1) res *= (nn - 1);
  return res;
}
long long fact(long long n, long long m) {
  long long res = 1;
  for (int i = 2; i <= n; ++i) res *= i, res %= m;
  return res;
}
long long modMulInv(long long a, long long m) { return pow(a, m - 2, m); }
long long nCr(long long n, long long r, long long m) {
  return (fact(n, m) * modMulInv((fact(n - r, m) * fact(r, m)) % m, MOD)) % m;
}
void tst(bool bol) { cout << (bol ? "YES" : "NO") << '\n'; }
void tst(bool bol1, bool bol2) {
  cout << (bol1 && bol2 ? "YES" : "NO") << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t, n, val, val1, val2, v, v1, v2, a, b, aa, bb, c, d;
  bool ok, ok1, ok2, done;
  vector<int> vec;
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> c >> d;
    int x = a - b, y = a + b;
    int s = n * x, l = n * y;
    int x1 = c - d, x2 = c + d;
    if (x1 > l || x2 < s)
      cout << "No";
    else
      cout << "Yes";
    cout << '\n';
  }
}
