/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.04 20:22:23
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

constexpr int MOD = 1e9 + 7;
int bitpopcount(ll n) {
    int res = 0;
    while (n) {
        if (n & 1) res++;
        n >>= 1;
    }
    return res;
}
int main() {
    int h,w,k,p;
    cin >> h >> w >> k >> p;
    vector<tuple<int,int,string>> a(k);
    for (int i = 0; i < k; i++) {
        int x,y;string s;cin >> x >> y >> s;
        a[i] = make_tuple(x,y,s);
    }
    ll ans = 0;
    vector<string> ans_vec;
    for (int i = 0; i < (1<<k); i++) {
        if (bitpopcount(i) != p) continue;
        vector<vector<bool>> ok(h + 1,vector<bool>(w + 1,true));
        for (int j = 0; j < k; j++) {
            if (!(i & (1 << j))) ok[get<0>(a[j])][get<1>(a[j])] = false;
        }
        vector<vector<ll>> dp(h + 1,vector<ll>(w + 1,0));
        dp[0][0] = 1;
        for (int x = 0; x <= h; x++) {
            for (int y = 0; y <= w; y++) {
                if (!ok[x][y]) continue;
                if (x >= 1) dp[x][y] += dp[x-1][y];
                if (y >= 1) dp[x][y] += dp[x][y-1];
            }
        }
        if (ans < dp[h][w]) {
            ans = dp[h][w];
            vector<string> vec;
            for (int j = 0; j < k; j++) {
                if (i & (1 << j)) {
                    vec.push_back(get<2>(a[j]));
                }
            }
            ans_vec = vec;
        }
    }
    cout << ans % MOD << endl;
    for (int i = 0; i < ans_vec.size(); i++) {
        cout << ans_vec[i] << endl;
    }
    return 0;
}