#include <bits/stdc++.h>
using namespace std;
long long inline gcd(long long x, long long y) {
  return !y ? (long long)abs(x) : gcd(y, x % y);
}
long long inline lcm(long long a, long long b) {
  return ((long long)abs((a / gcd(a, b)) * b));
}
double inline cartesian_dist(double x1, double y1, double x2, double y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
long long bigmod(long long b, long long p, long long m) {
  if (!p)
    return 1 % m;
  else if (p & 1)
    return (((b % m) + m) % m * bigmod(b, p - 1, m)) % m;
  else {
    long long ret = bigmod(b, p / 2, m);
    return (ret * ret) % m;
  }
}
long long inverse(long long a, long long m) { return bigmod(a, m - 2, m); }
long long extended(long long a, long long m) {
  long long oldr = a, r = m, oldans = 1, ans = 0, quotient;
  while (r) {
    quotient = oldr / r;
    oldr = oldr - r * quotient;
    swap(oldr, r);
    oldans = oldans - ans * quotient;
    swap(oldans, ans);
  }
  return ((oldans % m) + m) % m;
}
const double PI = acos(-1.0);
const double EPS = 10E-7;
int main() {
  long long b, q, l, m, x;
  while (4 == scanf("%lld %lld %lld %lld", &b, &q, &l, &m)) {
    set<long long> st;
    for (int i = 0; i < m; i++) {
      scanf("%lld", &x);
      st.insert(x);
    }
    if ((long long)abs(b) > l)
      printf("0\n");
    else {
      if (q == 0) {
        if (st.find(0) == st.end())
          printf("inf\n");
        else if (st.find(b) == st.end())
          printf("1\n");
        else
          printf("0\n");
      } else if (q == 1) {
        if (st.find(b) == st.end())
          printf("inf\n");
        else
          printf("0\n");
      } else if (q == -1) {
        if (st.find(b) == st.end() || st.find(-b) == st.end())
          printf("inf\n");
        else
          printf("0\n");
      } else {
        if (b == 0) {
          if (st.find(0) == st.end())
            printf("inf\n");
          else
            printf("0\n");
        } else {
          long long cnt = 0;
          while ((long long)abs(b) <= l) {
            if (st.find(b) == st.end()) cnt++;
            b *= q;
          }
          printf("%lld\n", cnt);
        }
      }
    }
  }
  return 0;
}
