codeforces 789 B. Masha and geometric depression (暴力+细节)

B. Masha and geometric depression

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise.

You are given geometric progression b defined by two integers b1 and q. Remind that a geometric progression is a sequence of integers b1, b2, b3, ..., where for each i > 1 the respective term satisfies the condition bi = bi - 1·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b1 and q can equal 0. Also, Dvastan gave Masha m "bad" integers a1, a2, ..., am, and an integer l.

Masha writes all progression terms one by one onto the board (including repetitive) while condition |bi| ≤ lis satisfied (|x| means absolute value of x). There is an exception: if a term equals one of the "bad" integers, Masha skips it (doesn't write onto the board) and moves forward to the next term.

But the lesson is going to end soon, so Masha has to calculate how many integers will be written on the board. In order not to get into depression, Masha asked you for help: help her calculate how many numbers she will write, or print "inf" in case she needs to write infinitely many integers.

Input

The first line of input contains four integers b1, q, l, m (-109 ≤ b1, q ≤ 109, 1 ≤ l ≤ 109, 1 ≤ m ≤ 105) — the initial term and the common ratio of progression, absolute value of maximal number that can be written on the board and the number of "bad" integers, respectively.

The second line contains m distinct integers a1, a2, ..., am (-109 ≤ ai ≤ 109) — numbers that will never be written on the board.

Output

Print the only integer, meaning the number of progression terms that will be written on the board if it is finite, or "inf" (without quotes) otherwise.

Examples

input

3 2 30 4
6 14 25 48

output

3

input

123 1 2143435 4
123 11 -5453 141245

output

0

input

123 1 2143435 4
54343 -13 6 124

output

inf

Note

In the first sample case, Masha will write integers 3, 12, 24. Progression term 6 will be skipped because it is a "bad" integer. Terms bigger than 24 won't be written because they exceed l by absolute value.

In the second case, Masha won't write any number because all terms are equal 123 and this is a "bad" integer.

In the third case, Masha will write infinitely integers 123.

题意很简单，就是给出b1 p l m, 满足b[i]=b[i-1]*p; (i>1),第二行给出m个数，求当 | b[i] |<=l 时且b[i]不等于第二行中的某个数

这题得分类讨论，

(1)|b1| > l,输出inf;

(2)b1==0 ,如果m个数中有0， 输出0；没有输出inf；

(3)p=0 , 如果0 不在 m个数中，输出inf； 否则 如果b1不在m个数中，输出1；否则输出0；

(4)p=1， 如果b1在 已知数中，输出0；否则输出inf；

(5) p=-1,如果b[1]和-b[1] 都不在已知数中，输出inf，否则只有一个在输出1，否则输出0；

(6)暴力其他情况。依次暴力b[i]=b[i-1]*p,如果不在已知数中，就计数加一

代码；

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define INF 0x3f3f3f
using namespace std;
__int64 b[100010],a[100010];
int main()
{
    int p,l,m;
    scanf("%I64d%d%d%d",&b[1],&p,&l,&m);
    for(int i=0;i<=m;i++)
        a[i]=INF;
    for(int i=0;i<m;i++)
        scanf("%I64d",&a[i]);
    sort(a,a+m);
    if(abs(b[1])>l)
        printf("0\n");
    else if(b[1]==0||p==1)
    {
        int pos=lower_bound(a,a+m,b[1])-a;
        if(a[pos]==b[1])
            printf("0\n");
        else
            printf("inf\n");
    }
    else if(p==0)
    {
        int pos1=lower_bound(a,a+m,0)-a;
        int pos2=lower_bound(a,a+m,b[1])-a;
        if(a[pos1]!=0)
            printf("inf\n");
        else if(a[pos2]==b[1])
            printf("0\n");
        else
            printf("1\n");
    }
    else if(p==-1)
    {
        int pos1=lower_bound(a,a+m,b[1])-a;
        int pos2=lower_bound(a,a+m,-b[1])-a;
        if(a[pos1]==b[1]&&a[pos2]==-b[1])
            printf("0\n");
        else
            printf("inf\n");
    }
    else{
        int cnt=0;
        for(__int64 i=b[1];abs(i)<=l;i=i*p)
        {
            int pos=lower_bound(a,a+m,i)-a;
            if(a[pos]!=i)
                cnt++;
        }
    printf("%d\n",cnt);
    }
    return 0;
}