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.
#include <bits/stdc++.h>
using namespace std;
long long inv(long long a, long long b, long long p) {
  long long r = 1;
  while (b) {
    if (b & 1) r = (r * a) % p;
    b >>= 1;
    a = (a * a) % p;
  }
  return r;
}
int main() {
  long long a, b, p, x, ans = 0;
  cin >> a >> b >> p >> x;
  for (long long i = 1; i <= p - 1; i++) {
    long long y = (b * inv(inv(a, i, p), p - 2, p)) % p;
    long long f = (i - y + p) % p;
    f = f * (p - 1) + i;
    if (x >= f) ans += max(0ll, (x - f) / (p * (p - 1)) + 1);
  }
  cout << ans;
  return 0;
}
