#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long f(long long m, long long a, long long c) {
	if (0 != c)m += a - c;
	return max(0LL, m / a);
}
long long solve(long long m, long long a, long long b, long long k) {
	long long g = gcd(a, b);
	if (0 != k % g)return 0;
	m /= g, a /= g, b /= g, k /= g;
	if (k > a) return 0;
	if (k == a) {
		long long ca = f(m, a, 0);
		long long cb = f(m, b, 0);
		long long cab = f(m, a*b, 0);
		long long x = ca + cb - cab;
		cb -= cab;
		long long mx = max((m / a)*a, (m / b)*b);
		if (0 == mx % a)return x - 1 - cb * 2;
		else return x - 1 - cb * 2 + 1;
	}
	auto c0 = crt({ 0, -k }, { a, b });
	auto c1 = crt({ -k, 0 }, { a, b });
	return f(m - k, c0.second, c0.first) + f(m - k, c1.second, c1.first);
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long m, a, b, k; cin >> m >> a >> b >> k;
		cout << solve(m, a, b, k) << endl;
	}
	return 0;
}