#include <bits/stdc++.h>
using namespace std;
long long qpow(long long a, long long n, long long MOD) {
  long long res = 1;
  long long tmp = a;
  while (n) {
    if (n & 1) {
      res = res * tmp % MOD;
    }
    tmp = tmp * tmp % MOD;
    n >>= 1;
  }
  return res;
}
long long inv(long long a, long long MOD) { return qpow(a, MOD - 2, MOD); }
int main() {
  long long a, b, p, x;
  cin >> a >> b >> p >> x;
  long long ans = 0;
  for (long long i = 1; i < p; i++) {
    long long t = b * inv(qpow(a, i, p), p) % p;
    long long n = i + (p - 1) * ((i - t + p) % p);
    ans += x / (p * (p - 1)) + (x % (p * (p - 1)) >= n ? 1 : 0);
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

Given an integer x. Your task is to find out how many positive integers n (1 ≤ n ≤ x) satisfy $$$n ⋅ a^n ≡ b   (mod\;p), where a, b, p$$$ are all known constants.

Input

The only line contains four integers a,b,p,x (2 ≤ p ≤ 10^6+3, 1 ≤ a,b < p, 1 ≤ x ≤ 10^{12}). It is guaranteed that p is a prime.

Output

Print a single integer: the number of possible answers n.

Examples

Input

2 3 5 8


Output

2


Input

4 6 7 13


Output

1


Input

233 233 10007 1


Output

1

Note

In the first sample, we can see that n=2 and n=8 are possible answers.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long qpow(long long a, long long n, long long MOD) {
  long long res = 1;
  long long tmp = a;
  while (n) {
    if (n & 1) {
      res = res * tmp % MOD;
    }
    tmp = tmp * tmp % MOD;
    n >>= 1;
  }
  return res;
}
long long inv(long long a, long long MOD) { return qpow(a, MOD - 2, MOD); }
int main() {
  long long a, b, p, x;
  cin >> a >> b >> p >> x;
  long long ans = 0;
  for (long long i = 1; i < p; i++) {
    long long t = b * inv(qpow(a, i, p), p) % p;
    long long n = i + (p - 1) * ((i - t + p) % p);
    ans += x / (p * (p - 1)) + (x % (p * (p - 1)) >= n ? 1 : 0);
  }
  cout << ans << endl;
  return 0;
}

```