#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

ll solve() {
  ll m, a, b, k;
  cin >> m >> a >> b >> k;
  if (k > a) return 0;
  if (k == a) {
    ll ca = m / a;
    if (ca == 0) return 0;
    m = ca * a;
    ll ans = ca - 1;
    ans -= m / b - m / lcm(a, b);
    return ans;
  } else {
    static VL rs; rs.clear();
    ll ans = 0;
    ll g = gcd(a, b);
    if (k % g) return 0;
    ll l = lcm(a, b);
    ans += m / l * 2;
    ll from = m / l * l;
    ll a2 = a / g, b2 = b / g;
    ll b2_inv = inv_mod(b2, a2);
    {
      ll r2 = k / g;
      ll x = r2 * b2_inv % a2;
      if (from + b * x <= m) ans++;
    }
    {
      ll r2 = (a - k) / g;
      ll x = r2 * b2_inv % a2;
      if (from + b * x + k <= m) ans++;
    }
    return ans;
  }
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    cout << solve() << '\n';
  }
}