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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long a, b, p, x;
  scanf("%I64d%I64d%I64d%I64d", &a, &b, &p, &x);
  long long aa = 1;
  for (int i = 0; i < p - 2; i++) aa = aa * a % p;
  long long ans = 0;
  long long bb = b;
  long long ii;
  for (int j = 0; j < p - 1; j++) {
    ii = j - bb;
    if (ii < 0) ii = ii + p;
    if (x >= j && (p - 1) * ii + j <= x) {
      ans += ((x - j) / (p - 1) - ii) / p + 1;
      if (ii == 0 && j == 0) ans--;
    }
    bb = bb * aa % p;
  }
  printf("%I64d\n", ans);
}