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 b₁ and q. Remind that a geometric progression is a sequence of integers b₁, b₂, b₃, ..., where for each i > 1 the respective term satisfies the condition b_i = b_i - 1·q, where q is called the common ratio of the progression. Progressions in Uzhlyandia are unusual: both b₁ and q can equal 0. Also, Dvastan gave Masha m "bad" integers a₁, a₂, ..., a_m, and an integer l.

Masha writes all progression terms one by one onto the board (including repetitive) while condition |b_i| ≤ l is 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.

The first line of input contains four integers b₁, q, l, m (-10⁹ ≤ b₁, q ≤ 10⁹, 1 ≤ l ≤ 10⁹, 1 ≤ m ≤ 10⁵) — 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 a₁, a₂, ..., a_m (-10⁹ ≤ a_i ≤ 10⁹) — numbers that will never be written on the board.

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.