#include <bits/stdc++.h>
using namespace std;
long long n, ans;
int a, b, p;
int inv[1000010];
int fast_pow(int a, int x) {
  int ans = 1;
  for (; x; x >>= 1, a = 1ll * a * a % p)
    if (x & 1) ans = 1ll * ans * a % p;
  return ans;
}
int main() {
  scanf("%d%d%d%lld", &a, &b, &p, &n);
  inv[0] = 1;
  inv[1] = fast_pow(a, p - 2);
  for (int i = 2; i < p; i++) inv[i] = 1ll * inv[i - 1] * inv[1] % p;
  for (int i = 0; i < p - 1; i++) {
    long long t =
        n - 1ll * ((p + i - (1ll * b * inv[i]) % p) % p) * (p - 1) - i;
    if (t >= 0) ans += t / p / (p - 1) + 1;
  }
  printf("%lld", 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;
long long n, ans;
int a, b, p;
int inv[1000010];
int fast_pow(int a, int x) {
  int ans = 1;
  for (; x; x >>= 1, a = 1ll * a * a % p)
    if (x & 1) ans = 1ll * ans * a % p;
  return ans;
}
int main() {
  scanf("%d%d%d%lld", &a, &b, &p, &n);
  inv[0] = 1;
  inv[1] = fast_pow(a, p - 2);
  for (int i = 2; i < p; i++) inv[i] = 1ll * inv[i - 1] * inv[1] % p;
  for (int i = 0; i < p - 1; i++) {
    long long t =
        n - 1ll * ((p + i - (1ll * b * inv[i]) % p) % p) * (p - 1) - i;
    if (t >= 0) ans += t / p / (p - 1) + 1;
  }
  printf("%lld", ans);
}

```