Problem: Nastya just made a huge mistake and dropped a whole package of rice on the floor. Mom will come soon. If she sees this, then Nastya will be punished.

In total, Nastya dropped n grains. Nastya read that each grain weighs some integer number of grams from a - b to a + b, inclusive (numbers a and b are known), and the whole package of n grains weighs from c - d to c + d grams, inclusive (numbers c and d are known). The weight of the package is the sum of the weights of all n grains in it.

Help Nastya understand if this information can be correct. In other words, check whether each grain can have such a mass that the i-th grain weighs some integer number x_i (a - b ≤ x_i ≤ a + b), and in total they weigh from c - d to c + d, inclusive (c - d ≤ ∑_{i=1}^{n}{x_i} ≤ c + d).

Input

The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. 

The next t lines contain descriptions of the test cases, each line contains 5 integers: n (1 ≤ n ≤ 1000) — the number of grains that Nastya counted and a, b, c, d (0 ≤ b < a ≤ 1000, 0 ≤ d < c ≤ 1000) — numbers that determine the possible weight of one grain of rice (from a - b to a + b) and the possible total weight of the package (from c - d to c + d).

Output

For each test case given in the input print "Yes", if the information about the weights is not inconsistent, and print "No" if n grains with masses from a - b to a + b cannot make a package with a total mass from c - d to c + d.

Example

Input


5
7 20 3 101 18
11 11 10 234 2
8 9 7 250 122
19 41 21 321 10
3 10 8 6 1


Output


Yes
No
Yes
No
Yes

Note

In the first test case of the example, we can assume that each grain weighs 17 grams, and a pack 119 grams, then really Nastya could collect the whole pack.

In the third test case of the example, we can assume that each grain weighs 16 grams, and a pack 128 grams, then really Nastya could collect the whole pack.

In the fifth test case of the example, we can be assumed that 3 grains of rice weigh 2, 2, and 3 grams, and a pack is 7 grams, then really Nastya could collect the whole pack.

In the second and fourth test cases of the example, we can prove that it is impossible to determine the correct weight of all grains of rice and the weight of the pack so that the weight of the pack is equal to the total weight of all collected grains.

Solution (in CPP):

Solution:
#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';
  }
}