#include <bits/stdc++.h>
int gcd(int a, int b) { return ((b == 0) ? a : gcd(b, a % b)); }
int lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
bool SQR(long double n) {
  long double sq = sqrt(n);
  return ((sq - floor(sq)) == 0);
}
using namespace std;
int n, a, b, c, d;
class Task {
 public:
  void solve() {
    int t;
    cin >> t;
    while (t--) {
      cin >> n >> a >> b >> c >> d;
      int l = (a - b) * n;
      int r = (a + b) * n;
      int l1 = (c - d);
      int r1 = (c + d);
      int c = 0;
      bool ok = 0;
      if ((l >= l1 && l <= r1) || (r >= l1 && r <= r1)) {
        ok = 1;
      } else if ((l1 >= l && l1 <= r) || (r1 >= l && r1 <= r)) {
        ok = 1;
      }
      if (ok)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
};
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  Task problem;
  problem.solve();
  return 0;
}
