CF919E.Congruence Equation

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

Given an integer $x$ . Your task is to find out how many positive integers $n$ ( $1<=n<=x$ ) satisfy

where $a,b,p$ are all known constants.

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.

Print a single integer: the number of possible answers $n$ .

In the first sample, we can see that $n=2$ and $n=8$ are possible answers.