#include <bits/stdc++.h>
int max(int a, int b) {
  if (a > b) {
    return a;
  }
  return b;
}
int min(int a, int b) {
  if (a < b) {
    return a;
  }
  return b;
}
int zt(int a, int b) { return max(a, b) - min(a, b); }
int round(int a, int b) {
  if ((a % b) * 2 >= b) {
    return (a / b) + 1;
  }
  return a / b;
}
int ceil(int a, int b) {
  if (a % b == 0) {
    return a / b;
  }
  return (a / b) + 1;
}
int gcd(int a, int b) {
  int c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int lcm(int a, int b) {
  int c = gcd(a, b);
  a /= c;
  return a * b;
}
int nCr(int a, int b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
int nHr(int a, int b) { return nCr(a + b - 1, b); }
int fact(int a) {
  int i, r = 1;
  for (i = 1; i <= a; i++) {
    r *= i;
  }
  return r;
}
int pow(int a, int b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
int dsum(int x) {
  int r = 0;
  while (x) {
    r += (x % 10);
    x /= 10;
  }
  return r;
}
int dsumb(int x, int b) {
  int r = 0;
  while (x) {
    r += (x % b);
    x /= b;
  }
  return r;
}
int sankaku(int x) { return ((1 + x) * x) / 2; }
long long llmax(long long a, long long b) {
  if (a > b) {
    return a;
  }
  return b;
}
long long llmin(long long a, long long b) {
  if (a < b) {
    return a;
  }
  return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
  if ((a % b) * 2 >= b) {
    return (a / b) + 1;
  }
  return a / b;
}
long long llceil(long long a, long long b) {
  if (a % b == 0) {
    return a / b;
  }
  return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
  long long c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
long long lllcm(long long a, long long b) {
  long long c = llgcd(a, b);
  a /= c;
  return a * b;
}
long long llnCr(long long a, long long b) {
  long long i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
  long long i, r = 1;
  for (i = 1; i <= a; i++) {
    r *= i;
  }
  return r;
}
long long llpow(long long a, long long b) {
  long long i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
long long lldsum(long long x) {
  long long r = 0;
  while (x) {
    r += (x % 10);
    x /= 10;
  }
  return r;
}
long long lldsumb(long long x, long long b) {
  long long r = 0;
  while (x) {
    r += (x % b);
    x /= b;
  }
  return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
double dbmax(double a, double b) {
  if (a > b) {
    return a;
  }
  return b;
}
double dbmin(double a, double b) {
  if (a < b) {
    return a;
  }
  return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
int sortfncsj(const void *a, const void *b) {
  if (*(int *)a > *(int *)b) {
    return 1;
  }
  if (*(int *)a == *(int *)b) {
    return 0;
  }
  return -1;
}
int sortfnckj(const void *a, const void *b) {
  if (*(int *)a < *(int *)b) {
    return 1;
  }
  if (*(int *)a == *(int *)b) {
    return 0;
  }
  return -1;
}
int llsortfncsj(const void *a, const void *b) {
  if (*(long long *)a > *(long long *)b) {
    return 1;
  }
  if (*(long long *)a == *(long long *)b) {
    return 0;
  }
  return -1;
}
int llsortfnckj(const void *a, const void *b) {
  if (*(long long *)a < *(long long *)b) {
    return 1;
  }
  if (*(long long *)a == *(long long *)b) {
    return 0;
  }
  return -1;
}
int dbsortfncsj(const void *a, const void *b) {
  if (*(double *)a > *(double *)b) {
    return 1;
  }
  if (*(double *)a == *(double *)b) {
    return 0;
  }
  return -1;
}
int dbsortfnckj(const void *a, const void *b) {
  if (*(double *)a < *(double *)b) {
    return 1;
  }
  if (*(double *)a == *(double *)b) {
    return 0;
  }
  return -1;
}
int strsortfncsj(const void *a, const void *b) {
  return strcmp((char *)a, (char *)b);
}
int strsortfnckj(const void *a, const void *b) {
  return strcmp((char *)b, (char *)a);
}
void shuffledget(int x[], int n) {
  srand(time(0));
  int i, b[524288], p, c;
  for (i = 0; i < n; i++) {
    b[i] = i;
  }
  for (i = n; i >= 1; i--) {
    p = rand() % i;
    c = b[i - 1];
    b[i - 1] = b[p];
    b[p] = c;
  }
  for (i = 0; i < n; i++) {
    scanf("%d", &x[b[i]]);
  }
}
int dx4[4] = {1, -1, 0, 0};
int dy4[4] = {0, 0, 1, -1};
int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int search(int x, int a[], int n) {
  int st = 0, fi = n - 1, te;
  while (st <= fi) {
    te = (st + fi) / 2;
    if (a[te] < x) {
      st = te + 1;
    } else {
      fi = te - 1;
    }
  }
  return st;
}
typedef struct {
  int val;
  int node;
} sd;
int sdsortfnc(const void *a, const void *b) {
  if (((sd *)a)->val < ((sd *)b)->val) {
    return -1;
  }
  if (((sd *)a)->val > ((sd *)b)->val) {
    return 1;
  }
  return 0;
}
int main(void) {
  long long i, j, n, m, k, s, a, b, c, h, w, r = 0, l, t;
  scanf("%lld", &t);
  for (i = 0; i < t; i++) {
    scanf("%lld%lld%lld%lld", &s, &a, &b, &c);
    r = (s / c);
    r += ((r / a) * b);
    printf("%lld\n", r);
  }
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

There is a special offer in Vasya's favourite supermarket: if the customer buys a chocolate bars, he or she may take b additional bars for free. This special offer can be used any number of times.

Vasya currently has s roubles, and he wants to get as many chocolate bars for free. Each chocolate bar costs c roubles. Help Vasya to calculate the maximum possible number of chocolate bars he can get!

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of testcases.

Each of the next t lines contains four integers s, a, b, c~(1 ≤ s, a, b, c ≤ 10^9) — the number of roubles Vasya has, the number of chocolate bars you have to buy to use the special offer, the number of bars you get for free, and the cost of one bar, respectively.

Output

Print t lines. i-th line should contain the maximum possible number of chocolate bars Vasya can get in i-th test.

Example

Input

2
10 3 1 1
1000000000 1 1000000000 1


Output

13
1000000001000000000

Note

In the first test of the example Vasya can buy 9 bars, get 3 for free, buy another bar, and so he will get 13 bars.

In the second test Vasya buys 1000000000 bars and gets 1000000000000000000 for free. So he has 1000000001000000000 bars.

### Response

```cpp
#include <bits/stdc++.h>
int max(int a, int b) {
  if (a > b) {
    return a;
  }
  return b;
}
int min(int a, int b) {
  if (a < b) {
    return a;
  }
  return b;
}
int zt(int a, int b) { return max(a, b) - min(a, b); }
int round(int a, int b) {
  if ((a % b) * 2 >= b) {
    return (a / b) + 1;
  }
  return a / b;
}
int ceil(int a, int b) {
  if (a % b == 0) {
    return a / b;
  }
  return (a / b) + 1;
}
int gcd(int a, int b) {
  int c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int lcm(int a, int b) {
  int c = gcd(a, b);
  a /= c;
  return a * b;
}
int nCr(int a, int b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
int nHr(int a, int b) { return nCr(a + b - 1, b); }
int fact(int a) {
  int i, r = 1;
  for (i = 1; i <= a; i++) {
    r *= i;
  }
  return r;
}
int pow(int a, int b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
int dsum(int x) {
  int r = 0;
  while (x) {
    r += (x % 10);
    x /= 10;
  }
  return r;
}
int dsumb(int x, int b) {
  int r = 0;
  while (x) {
    r += (x % b);
    x /= b;
  }
  return r;
}
int sankaku(int x) { return ((1 + x) * x) / 2; }
long long llmax(long long a, long long b) {
  if (a > b) {
    return a;
  }
  return b;
}
long long llmin(long long a, long long b) {
  if (a < b) {
    return a;
  }
  return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
  if ((a % b) * 2 >= b) {
    return (a / b) + 1;
  }
  return a / b;
}
long long llceil(long long a, long long b) {
  if (a % b == 0) {
    return a / b;
  }
  return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
  long long c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
long long lllcm(long long a, long long b) {
  long long c = llgcd(a, b);
  a /= c;
  return a * b;
}
long long llnCr(long long a, long long b) {
  long long i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
  long long i, r = 1;
  for (i = 1; i <= a; i++) {
    r *= i;
  }
  return r;
}
long long llpow(long long a, long long b) {
  long long i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
long long lldsum(long long x) {
  long long r = 0;
  while (x) {
    r += (x % 10);
    x /= 10;
  }
  return r;
}
long long lldsumb(long long x, long long b) {
  long long r = 0;
  while (x) {
    r += (x % b);
    x /= b;
  }
  return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
double dbmax(double a, double b) {
  if (a > b) {
    return a;
  }
  return b;
}
double dbmin(double a, double b) {
  if (a < b) {
    return a;
  }
  return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
int sortfncsj(const void *a, const void *b) {
  if (*(int *)a > *(int *)b) {
    return 1;
  }
  if (*(int *)a == *(int *)b) {
    return 0;
  }
  return -1;
}
int sortfnckj(const void *a, const void *b) {
  if (*(int *)a < *(int *)b) {
    return 1;
  }
  if (*(int *)a == *(int *)b) {
    return 0;
  }
  return -1;
}
int llsortfncsj(const void *a, const void *b) {
  if (*(long long *)a > *(long long *)b) {
    return 1;
  }
  if (*(long long *)a == *(long long *)b) {
    return 0;
  }
  return -1;
}
int llsortfnckj(const void *a, const void *b) {
  if (*(long long *)a < *(long long *)b) {
    return 1;
  }
  if (*(long long *)a == *(long long *)b) {
    return 0;
  }
  return -1;
}
int dbsortfncsj(const void *a, const void *b) {
  if (*(double *)a > *(double *)b) {
    return 1;
  }
  if (*(double *)a == *(double *)b) {
    return 0;
  }
  return -1;
}
int dbsortfnckj(const void *a, const void *b) {
  if (*(double *)a < *(double *)b) {
    return 1;
  }
  if (*(double *)a == *(double *)b) {
    return 0;
  }
  return -1;
}
int strsortfncsj(const void *a, const void *b) {
  return strcmp((char *)a, (char *)b);
}
int strsortfnckj(const void *a, const void *b) {
  return strcmp((char *)b, (char *)a);
}
void shuffledget(int x[], int n) {
  srand(time(0));
  int i, b[524288], p, c;
  for (i = 0; i < n; i++) {
    b[i] = i;
  }
  for (i = n; i >= 1; i--) {
    p = rand() % i;
    c = b[i - 1];
    b[i - 1] = b[p];
    b[p] = c;
  }
  for (i = 0; i < n; i++) {
    scanf("%d", &x[b[i]]);
  }
}
int dx4[4] = {1, -1, 0, 0};
int dy4[4] = {0, 0, 1, -1};
int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int search(int x, int a[], int n) {
  int st = 0, fi = n - 1, te;
  while (st <= fi) {
    te = (st + fi) / 2;
    if (a[te] < x) {
      st = te + 1;
    } else {
      fi = te - 1;
    }
  }
  return st;
}
typedef struct {
  int val;
  int node;
} sd;
int sdsortfnc(const void *a, const void *b) {
  if (((sd *)a)->val < ((sd *)b)->val) {
    return -1;
  }
  if (((sd *)a)->val > ((sd *)b)->val) {
    return 1;
  }
  return 0;
}
int main(void) {
  long long i, j, n, m, k, s, a, b, c, h, w, r = 0, l, t;
  scanf("%lld", &t);
  for (i = 0; i < t; i++) {
    scanf("%lld%lld%lld%lld", &s, &a, &b, &c);
    r = (s / c);
    r += ((r / a) * b);
    printf("%lld\n", r);
  }
  return 0;
}

```