#include <bits/stdc++.h>
using namespace std;
inline long long add(long long a, long long b) {
  return (a % 1000000007 + b % 1000000007) % 1000000007;
}
inline long long mul(long long a, long long b) {
  return (a % 1000000007 * b % 1000000007) % 1000000007;
}
long long pwr(long long a, long long b) {
  if (!b) return 1ll;
  long long t = pwr(a, b / 2);
  t = mul(t, t);
  if (b & 1) t = mul(t, a);
  return t;
}
long long modinv(long long a, long long b = 1000000007) {
  return pwr(a, b - 2);
}
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, a, b, c, d;
    cin >> n >> a >> b >> c >> d;
    int x = a - b, y = a + b;
    int p = c - d, q = c + d;
    int mn = x * n, flag = 1;
    for (int i = 1; i <= n; i++) {
      if (mn <= q && mn >= p) {
        flag = 0;
        break;
      }
      if (mn < p) {
        int diff = p - mn;
        mn += min(diff, 2 * b);
      }
    }
    if (mn <= q && mn >= p) {
      flag = 0;
    }
    if (flag)
      cout << "No\n";
    else
      cout << "Yes\n";
  }
}
