#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
void out(vector<long long> arr) {
  for (auto i : arr) {
    cout << i << ' ';
  }
  cout << endl;
}
void out(vector<pair<long long, long long>> par) {
  for (auto i : par) {
    cout << i.first << ' ';
  }
  cout << endl;
  for (auto i : par) {
    cout << i.second << ' ';
  }
  cout << endl;
}
void out(set<long long> arr) {
  for (auto i : arr) {
    cout << i << ' ';
  }
  cout << endl;
}
void inp(vector<long long> &arr) {
  for (long long i = 0; i < arr.size(); i++) {
    cin >> arr[i];
  }
}
void inp(long long &n) { cin >> n; }
void inp(long long &a, long long &b, long long &c) { cin >> a >> b >> c; }
void inp(long long &a, long long &b) { cin >> a >> b; }
void inp(long long &a, long long &b, long long &c, long long &d) {
  cin >> a >> b >> c >> d;
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, a, b, c, d;
    cin >> n >> a >> b >> c >> d;
    long long mins = c - d;
    long long mas = c + d;
    if (n * (a - b) > mas || n * (a + b) < mins) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
    }
  }
}
