#include<cstdio>
#include<vector>
#include<algorithm>


using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using ll=long long;
using vll=vector<ll>;
using vvll=vector<vll>;


struct friend_t
{
	int x, y;
	char name[10+2];
};


int main(void)
{
	int w, h, k, p;

	while(scanf("%d%d%d%d", &w, &h, &k, &p)==4)
	{
		vector<friend_t> f(k);
		vi use(k), ans_use(k);
		vvll dp(h+1);
		ll ans=0;

		for(int i=0;i<k;i++)
		{
			scanf("%d%d%10s", &f[i].x, &f[i].y, f[i].name);
			use[i]=(i<p);
		}

		do
		{
			for(auto&dpe:dp) dpe.assign(w+1, 0);
			dp[0][0]=1;

			for(int i=0;i<k;i++)
			{
				if(!use[i]) dp[f[i].y][f[i].x]=-1;
			}
			for(int y=0;y<=h;y++)
			{
				for(int x=0;x<=w;x++)
				{
					if(dp[y][x]<0) continue;
					if(y>0 && dp[y-1][x  ]>0) dp[y][x]+=dp[y-1][x  ];
					if(x>0 && dp[y  ][x-1]>0) dp[y][x]+=dp[y  ][x-1];
				}
			}
			if(ans<dp[h][w])
			{
				ans=dp[h][w];
				ans_use=use;
			}
		}
		while(prev_permutation(use.begin(), use.end()));

		printf("%d\n", (int)(ans%1000000007));
		for(int i=0;i<k;i++)
		{
			if(ans_use[i]) printf("%s\n", f[i].name);
		}
	}

	return 0;
}