MOD = 10**9 + 7

H, W, K, P = map(int, input().split())
friends = []
friend_grid = [[-1 for _ in range(W+1)] for _ in range(H+1)]
for idx in range(K):
    x, y, name = input().split()
    x = int(x)
    y = int(y)
    friends.append((x, y, name))
    friend_grid[x][y] = idx

max_count = -1
best_mask = 0

for mask in range(1 << K):
    bits = bin(mask).count('1')
    if bits > P:
        continue
    dp = [[0] * (W + 1) for _ in range(H + 1)]
    dp[0][0] = 1
    for x in range(H + 1):
        for y in range(W + 1):
            if x == 0 and y == 0:
                continue
            blocked = False
            if friend_grid[x][y] != -1:
                idx_friend = friend_grid[x][y]
                if not (mask & (1 << idx_friend)):
                    blocked = True
            if blocked:
                dp[x][y] = 0
            else:
                total = 0
                if x > 0:
                    total += dp[x-1][y]
                if y > 0:
                    total += dp[x][y-1]
                dp[x][y] = total % MOD
    current_count = dp[H][W]
    if current_count > max_count or (current_count == max_count and mask < best_mask):
        max_count = current_count
        best_mask = mask

if max_count == 0:
    print(0)
else:
    print(max_count % MOD)
    selected_names = [friends[i][2] for i in range(K) if (best_mask & (1 << i))]
    for name in selected_names:
        print(name)