#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const ll MOD = 1000000007;

int x[15], y[15];
string N[15];
ll dp[33][33][1 << 15], dp2[33][33][1 << 15], dp3[1 << 15], dp4[1 << 15];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int H, W, K, P;
	cin >> H >> W >> K >> P;
	map<pii, int> mp;
	for (int i = 0; i < K; i++) {
		cin >> x[i] >> y[i] >> N[i];
		mp[pii(x[i], y[i])] = i;
	}

	pii cur(0, 0);
	if (mp.find(cur) == mp.end()) dp2[0][0][0] = 1;
	else dp2[0][0][1 << mp[cur]] = 1;

	for (int i = 0; i <= H; i++) {
		for (int j = 0; j <= W; j++) {
			if (i == 0 && j == 0) continue;
			int s;
			cur = pii(i, j);
			if (mp.find(cur) == mp.end()) s = 0;
			else s = (1 << mp[cur]);
			for (int k = 0; k < (1 << K); k++) {
				if (s != 0 && (k & s) == 0) continue;
				if (i > 0) {
					dp[i][j][k] += dp[i - 1][j][k - s];
					dp2[i][j][k] += dp2[i - 1][j][k - s];
				}
				if (j > 0) {
					dp[i][j][k] += dp[i][j - 1][k - s];
					dp2[i][j][k] += dp2[i][j - 1][k - s];
				}
				dp[i][j][k] += dp2[i][j][k] / MOD;
				dp2[i][j][k] %= MOD;
			}
		}
	}

	for (int i = 0; i < (1 << K); i++) {
		dp3[i] = dp[H][W][i];
		dp4[i] = dp2[H][W][i];
		for (int j = 0; j < i; j++) {
			if ((i & j) != j) continue;
			dp3[i] += dp[H][W][j];
			dp4[i] += dp2[H][W][j];
			dp3[i] += dp4[i] / MOD;
			dp4[i] %= MOD;
		}
	}

	/*
	for (int i = 1; i < (1 << K); i++) {
		for (int j = 0; j < K; j++) {
			if (i & (1 << j)) {
				dp[H][W][i] += dp[H][W][i - (1 << j)];
				dp2[H][W][i] += dp2[H][W][i - (1 << j)];
				dp[H][W][i] += dp2[H][W][i] / MOD;
				dp2[H][W][i] %= MOD;
			}
		}
	}*/

	/*
	int k = 0;
	for (int i = 0; i < (1 << K); i++) {
		int cnt = 0;
		for (int j = 0; j < K; j++) {
			if (i & (1 << j)) cnt++;
		}
		if (cnt > P) continue;
		if (dp[H][W][i] > dp[H][W][k] || (dp[H][W][i] == dp[H][W][k] && dp2[H][W][i] > dp2[H][W][k])) {
			k = i;
		}
	}*/

	int k = 0;
	for (int i = 0; i < (1 << K); i++) {
		int cnt = 0;
		for (int j = 0; j < K; j++) {
			if (i & (1 << j)) cnt++;
		}
		if (cnt > P) continue;
		if (dp3[i] > dp3[k] || (dp3[i] == dp3[k] && dp4[i] > dp4[k])) {
			k = i;
		}
	}

	cout << dp4[k] << endl;
	if (dp3[k] == 0 && dp4[k] == 0) return 0;
	for (int i = 0; i < K; i++) {
		if (k & (1 << i)) cout << N[i] << endl;
	}
	return 0;
}