#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int h, w, k, p, x[15], y[15];
string n[15];

LL dp[33][33];
LL mm[33][33];

LL bc(LL n) {
	LL ans = 0;
	while(n) { ans += n % 2; n /= 2; }
	return ans;
}

int main() {
	cin >> h >> w >> k >> p;
	inc(i, k) { cin >> x[i] >> y[i] >> n[i]; }
	
	inc(i, k) { mm[ x[i] ][ y[i] ] = i + 1; }
	
	LL ans = 0;
	int mb = 0;
	inc(b, 1 << k) {
		if(bc(b) <= p) {
			inc(i, h + 1) {
			inc(j, w + 1) {
				dp[i][j] = 0;
			}
			}
			dp[0][0] = (mm[0][0] == 0) || (b & (1 << (mm[0][0] - 1)));
			
			inc(i, h + 1) {
			inc(j, w + 1) {
				if( mm[i][j] == 0 || (b & (1 << (mm[i][j] - 1))) ) {
					if(i != 0) { dp[i][j] += dp[i - 1][j]; }
					if(j != 0) { dp[i][j] += dp[i][j - 1]; }
				}
			}
			}
			
			if(setmax(ans, dp[h][w])) { mb = b; }
			
			/*
			inc(i, h + 1) {
			inc(j, w + 1) {
				cout << dp[i][j] << " ";
			} cout << endl;
			} cout << endl;
			cout << dp[w][h] << endl;
			*/
		}
	}
	
	cout << ans % 1000000007 << endl;
	inc(i, k) {
		if(mb & (1 << i)) { cout << n[i] << endl; }
	}
	
	return 0;
}