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

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

int H,W,K,P;

int dy[]={-1,0,1,0};
int dx[]={0,-1,0,1};
int x[22],y[22];
string name[22];

bool ex[44][44];

int dist[44][44];
int way[44][44];

int calc(int b){
    memset(ex,0,sizeof(ex));
    memset(way,0,sizeof(way));
    rep(i,K)if(!(b>>i&1))ex[y[i]][x[i]]=1;

    fill_n(*dist,44*44,INT_MAX);
    dist[0][0]=0;
    way[0][0]=1;

    queue<pint>que;
    que.push({0,0});
    while(que.size()){
        int y,x;
        tie(y,x)=que.front();
        que.pop();
        if(ex[y][x]){
            way[y][x]=0;
            continue;
        }
        rep(d,4){
            int ny=y+dy[d];
            int nx=x+dx[d];
            if(ny<0||ny>H||nx<0||nx>W)continue;
            if(dist[ny][nx]==dist[y][x]+1){
                way[ny][nx]+=way[y][x];
                continue;
            }
            if(dist[ny][nx]!=INT_MAX)continue;
            dist[ny][nx]=dist[y][x]+1;
            way[ny][nx]=way[y][x];
            que.push({ny,nx});
        }
    }
    return way[H][W];
}

signed main(){
    cin>>H>>W>>K>>P;
    rep(i,K)cin>>y[i]>>x[i]>>name[i];

    int ma=0,arcma=0;
    rep(i,1<<K){
        int pc=0;
        rep(j,K)if(i>>j&1)pc++;
        if(pc>P)continue;
        int tmp=calc(i);
        if(ma<tmp){
            ma=tmp;
            arcma=i;
        }
    }

    cout<<ma%1000000007<<endl;
    rep(i,K)if(arcma>>i&1)cout<<name[i]<<endl;
    return 0;
}