#include <bits/stdc++.h>
using namespace std;
long long x, ans, P, a, b, p, t, k;
long long bin(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % p;
    a = a * a % p;
    b >>= 1;
  }
  return ans;
}
int main() {
  cin >> a >> b >> p >> x;
  P = p * (p - 1);
  for (int j = 1; j < p; j++) {
    t = b * bin(a, p - j - 1) % p, k = (p * j % P + (p - t) * (p - 1) % P) % P;
    ans += x / P;
    if (x % P >= k) ans++;
  }
  cout << ans;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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 x, ans, P, a, b, p, t, k;
long long bin(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % p;
    a = a * a % p;
    b >>= 1;
  }
  return ans;
}
int main() {
  cin >> a >> b >> p >> x;
  P = p * (p - 1);
  for (int j = 1; j < p; j++) {
    t = b * bin(a, p - j - 1) % p, k = (p * j % P + (p - t) * (p - 1) % P) % P;
    ans += x / P;
    if (x % P >= k) ans++;
  }
  cout << ans;
}

```