#include <bits/stdc++.h>
using namespace std;
void solve();
int gcd(int a, int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
bool isPrime(long long int a) {
  for (int i = 2; i <= sqrt(a); i++) {
    if (a % i == 0) return false;
  }
  return true;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, c, d, a, b;
    cin >> n >> a >> b >> c >> d;
    int p = a - b, q = a + b;
    int x = c - d, y = c + d;
    p *= n;
    q *= n;
    if ((x <= p && p <= y) || (x <= q && q <= y) || (p < x && q > y)) {
      cout << "Yes"
           << "\n";
    } else if (p > y || q < x)
      cout << "No"
           << "\n";
  }
  return 0;
}
void solve() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  return;
}
