#include <bits/stdc++.h>
using namespace std;
int ex(int a, int b, int m) {
  int r = 1;
  while (b > 0) {
    if (b & 1) r = r * 1ll * a % m;
    a = a * 1ll * a % m;
    b >>= 1;
  }
  return r;
}
int inv(int a, int p) { return ex(a, p - 2, p); }
int main() {
  long long a, b, p, x;
  cin >> a >> b >> p >> x;
  long long ans = 0;
  for (int i = 1; i <= p - 1; i++) {
    int var = (long long)b * inv((long long)ex(a, i, p), p) % p;
    long long primero = (long long)(p - 1) * ((i - var + p) % p) + i;
    if (primero > x) continue;
    ans += (x - primero) / ((long long)p * (p - 1)) + 1;
  }
  cout << ans;
}

### 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;
int ex(int a, int b, int m) {
  int r = 1;
  while (b > 0) {
    if (b & 1) r = r * 1ll * a % m;
    a = a * 1ll * a % m;
    b >>= 1;
  }
  return r;
}
int inv(int a, int p) { return ex(a, p - 2, p); }
int main() {
  long long a, b, p, x;
  cin >> a >> b >> p >> x;
  long long ans = 0;
  for (int i = 1; i <= p - 1; i++) {
    int var = (long long)b * inv((long long)ex(a, i, p), p) % p;
    long long primero = (long long)(p - 1) * ((i - var + p) % p) + i;
    if (primero > x) continue;
    ans += (x - primero) / ((long long)p * (p - 1)) + 1;
  }
  cout << ans;
}

```