#include <bits/stdc++.h>
using namespace std;
long long a, b, p, n, ans;
long long power(int a, int b) {
  if (b == 0) return 1LL;
  long long k = power(a, b / 2);
  k = (k * k) % p;
  if (b % 2) return (k * a) % p;
  return k;
}
long long inv(long long n) { return power(n, p - 2); }
int main() {
  ios_base::sync_with_stdio(0);
  cin >> a >> b >> p >> n;
  for (int j = 1; j <= p - 1; j++) {
    long long y = (b * inv(power(a, j))) % p;
    long long f = (p - 1) * ((j - y + p) % p) + j;
    if (f > n) continue;
    ans += (n - f) / (p * (p - 1)) + 1;
  }
  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, n, ans;
long long power(int a, int b) {
  if (b == 0) return 1LL;
  long long k = power(a, b / 2);
  k = (k * k) % p;
  if (b % 2) return (k * a) % p;
  return k;
}
long long inv(long long n) { return power(n, p - 2); }
int main() {
  ios_base::sync_with_stdio(0);
  cin >> a >> b >> p >> n;
  for (int j = 1; j <= p - 1; j++) {
    long long y = (b * inv(power(a, j))) % p;
    long long f = (p - 1) * ((j - y + p) % p) + j;
    if (f > n) continue;
    ans += (n - f) / (p * (p - 1)) + 1;
  }
  cout << ans << endl;
  return 0;
}

```