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

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

```