#include <bits/stdc++.h>
using namespace std;
long long a, b, p, x, ans = 0;
long long quick_pow(long long x, long long y, long long mod) {
  long long ret = 1;
  for (; y; y >>= 1) {
    if (y & 1) ret = (ret * x) % mod;
    x = (x * x) % mod;
  }
  return ret;
}
int main() {
  cin >> a >> b >> p >> x;
  for (long long i = 1; i < p; ++i) {
    long long inv = quick_pow(quick_pow(a, i, p), p - 2, p);
    long long y = b * inv % p;
    long long P = p * (p - 1);
    long long r = (p * i + (p - 1) * (p - 1) % P * y) % P;
    ans += x / P + (x % P >= r);
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Please formulate 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 a, b, p, x, ans = 0;
long long quick_pow(long long x, long long y, long long mod) {
  long long ret = 1;
  for (; y; y >>= 1) {
    if (y & 1) ret = (ret * x) % mod;
    x = (x * x) % mod;
  }
  return ret;
}
int main() {
  cin >> a >> b >> p >> x;
  for (long long i = 1; i < p; ++i) {
    long long inv = quick_pow(quick_pow(a, i, p), p - 2, p);
    long long y = b * inv % p;
    long long P = p * (p - 1);
    long long r = (p * i + (p - 1) * (p - 1) % P * y) % P;
    ans += x / P + (x % P >= r);
  }
  cout << ans << endl;
  return 0;
}

```