#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 33;

ull dp[MAX_N][MAX_N];
bool flag[MAX_N][MAX_N];
vector<string> vec;
ull opt;

int main()
{
    int h,w,K,p;
    cin >> w >> h >> K >> p;
    vector<int> x(K),y(K);
    vector<string> N(K);
    rep(i,K){
        cin >> x[i] >> y[i] >> N[i];
    }
    opt = 0;
    vector<bool> v(K);
    fill(v.end() - p, v.end(), true);
    do {
        vector<int> res;
        rep(i,K) {
            if (v[i]) {
                res.pb(i);
            }
        }
        rep(i,w+1){
            rep(j,h+1){
                flag[i][j] = false;
            }
        }
        rep(i,K){
            flag[x[i]][y[i]] = true;
        }
        rep(i,p){
            flag[x[res[i]]][y[res[i]]] = false;
        }
        rep(i,w+1){
            rep(j,h+1){
                dp[i][j] = 0;
            }
        }
        dp[0][0] = 1;
        rep(i,h){
            if(flag[0][i+1]){
                dp[0][i+1] = 0;
            }else{
                dp[0][i+1] = dp[0][i];
            }
        }
        rep(i,w){
            if(flag[i+1][0]){
                dp[i+1][0] = 0;
            }else{
                dp[i+1][0] = dp[i][0];
            }
        }
        rep(i,w){
            rep(j,h){
                if(flag[i+1][j+1]){
                    dp[i+1][j+1] = 0;
                }else{
                    dp[i+1][j+1] = dp[i+1][j] + dp[i][j+1];
                }
            }
        }
        if(dp[w][h] > opt){
            opt = dp[w][h];
            vec.clear();
            rep(i,p){
                vec.pb(N[res[i]]);
            }
        }
    } while (next_permutation(v.begin(), v.end()));
    cout << opt % MOD << endl;
    rep(i,p){
        cout << vec[i] << endl;
    }
    return 0;
}