import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// sum_{x=l}^r floor((a x + b) / m)
// m > 0
long sumFloors(long m, long a, long b, long l, long r)
in {
  assert(m > 0, "sumFloors: m > 0 must hold");
}
do {
  long sum;
  for (; l <= r; ) {
    const q = divFloor(a, m);
    const aa = a - q * m;
    const ll = divFloor(aa * l + b, m) + 1;
    const rr = divFloor(aa * r + b, m);
    // TODO: overflow if ll or rr is big in recursion
    // sum += q * ((r + 1) * r / 2 - l * (l - 1) / 2) + r * rr - (l - 1) * (ll - 1) + (rr - ll + 1);
long waf(long n0, long n1) {
  ((n0 % 2 == 0) ? n0 : n1) /= 2;
  return n0 * n1;
}
    sum += q * (waf(r + 1, r) - waf(l, l - 1)) + r * rr - (l - 1) * (ll - 1) + (rr - ll + 1);
    a = m; m = aa; l = -rr; r = -ll;
  }
  return sum;
}


void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const M = readLong;
        const A = readLong;
        const B = readLong;
        const K = readLong;
        
        const QA = M / A;
        const QB = M / B;
        
        // B x == r (mod A)
        long calc(long r) {
          const lim = QA * A / B;
          long ret;
          ret += sumFloors(A, B, -r, 1, lim);
          ret -= sumFloors(A, B, -r - 1, 1, lim);
          return ret;
        }
        
        long ans;
        if (K < A) {
          ans += calc(K);
          ans += calc(A - K);
          if (QA * A + K == QB * B) {
            ans += 1;
          }
        } else if (K == A) {
assert(false);
          ans = QA - 1;
          ans -= (QB - M / (A / gcd(A, B) * B));
        } else {
          //
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}