#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int H,W,K,P;


struct Pos {
    int x, y;
    string name;
};
const int MOD = 1000000007;

Pos F[15];

void solve() {
    cin>>H>>W>>K>>P;
    
    REP(i,K) cin>>F[i].x>>F[i].y>>F[i].name;
    
    int ans = 0;
    vector<string> ansn;
    int DP[H+1][W+1];
    
    REP(i,1<<K) {
        bitset<15> bit(i);
        if (bit.count() == 0) continue;
        if (bit.count() > P) continue;
        REP(h,H+1)REP(w,W+1)DP[h][w]=0;
        DP[0][0]=1;
        REP(j,K)if(!bit[j]) {
            auto f = F[j];
            DP[f.x][f.y]=-1;
        }
        REP(h,H+1)REP(w,W+1) {
            if (DP[h][w]<0) continue;
            if (h>0 && DP[h-1][w]>=0) {
                DP[h][w] += DP[h-1][w];
            }
            if (w>0 && DP[h][w-1]>=0) DP[h][w] += DP[h][w-1];
        }
        int ret = DP[H][W];
        if (ret>ans) {
            ans = ret;
            ansn.clear();
            REP(j,K)if(bit[j]) ansn.push_back(F[j].name);
        }
    }
    
    cout << ans%MOD << endl;
    for (auto n:ansn) cout << n << endl;
}