from functools import *
import sys
sys.set_int_max_str_digits(10**5)

N, T = map(int, input().split())
S = input()

Y = [0 for i in range(N + 1)]
for i in range(N):
    Y[i + 1] = Y[i] + (ord(S[i]) - ord('0'))
# print(Y)
D = [0 for i in range(N)]
for i in range(N):
    D[i] = N * Y[i] - Y[N] * i
# print(D)

# sub2
def cmp(a, b):
    d = a[0] * b[1] - a[1] * b[0]
    if (d > 0):
        return -1
    if (d < 0):
        return +1
    return (a[1] - b[1])
LIM_SUB2 = 1005
xs = []
if N <= 10:
    xs = [(0, 0) for i in range(N * LIM_SUB2)]
    for q in range(LIM_SUB2):
        for r in range(N):
            xs[N * q + r] = (Y[N] * q + Y[r], N * q + r)
    xs = sorted(xs, key=cmp_to_key(cmp))

for T in range(T):
    O, K = map(int, input().split())
    if (O == 1):
        if (Y[N - 1] == 0 and Y[N] == 1):
            # sub1
            print(K * N)
        elif (K < LIM_SUB2 - 1):
            # sub2
            print(xs[K][1])
        else:
            print("TODO")
    else:
        Q = K // N
        R = K % N
        if (D[R] < 0):
            print("inf")
        elif (D[R] == 0):
            hasBig = False
            for r in range(N):
                if (D[r] > 0):
                    hasBig = True
            if (hasBig):
                print("inf")
            else:
                ans = 0
                cnt = 0
                for r in range(N):
                    if (D[r] == 0):
                        cnt += 1
                        if (r <= R):
                            ans += 1
                        if (r == 0):
                            ans -= 1
                ans += cnt * Q
                print(ans)
        else:
            a = K // D[R]
            b = K % D[R]
            c = (Y[N] * Q + Y[R]) // D[R]
            d = (Y[N] * Q + Y[R]) % D[R]
            ans = 0
            cntA = 0
            cntC = 0
            for r in range(N):
                if (D[r] > 0):
                    # Y[r]/r >= Y[K]/K ?
                    if (Q >= ((Y[R] * r - R * Y[r]) + D[R] - 1) // D[R]):
                        # q <= (a D[R] + b) Y[r] - (c D[R] + d) r
                        cntA += Y[r]
                        cntC -= r
                        e = b * Y[r] - d * r
                        f = e // D[R]
                        ans += (f + 1)
                        if (r == 0):
                            ans -= 1
                        if (e % D[R] == 0):
                            # (a * Y[r] - c * r + f, r) > (Q, R)
                            q = a * Y[r] - c * r + f
                            if (q > Q or (q == Q and r > R)):
                                ans -= 1
            ans += cntA * a
            ans += cntC * c
            print(ans)