def popcount(n):
    cnt = 0
    while n:
        cnt += n & 1
        n >>= 1
    return cnt


H, W, K, P = map(int, input().split())
mod = 10 ** 9 + 7
L = []
G = [[1] * (W + 1) for i in range(H + 1)]
for i in range(K):
    lst = input().split()
    lst[0] = int(lst[0])
    lst[1] = int(lst[1])
    G[lst[0]][lst[1]] = 0
    lst.append(i)
    L.append(lst)

K2 = 1 << K
maxv = 0
name = None

def calc():
    dp = [[0] * (W + 1) for i in range(H + 1)]
    dp[0][0] = 1
    for i in range(H + 1):
        for j in range(W + 1):
            if i == j == 0 or G[i][j] == 0:
                continue
            if i:
                dp[i][j] += dp[i - 1][j]
            if j:
                dp[i][j] += dp[i][j - 1]
    return dp[H][W]



for s in range(K2):
    if popcount(s) != P:
        continue
    for x, y, _, ind in L:
        if (s >> ind) & 1:
            G[x][y] = 1

    temp = calc()
    if temp > maxv:
        maxv = temp
        name = []
        for x, y, n, ind in L:
            if (s >> ind) & 1:
                name.append(n)

    for x, y, _, ind in L:
        if (s >> ind) & 1:
            G[x][y] = 0
    
print(maxv%mod)
if name:
    for n in name:
        print(n)