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


using namespace std;


typedef long long ll;

struct fre_t
{
	int x, y;
	char name[20];
};


int w, h, k, p;
vector<vector<ll> > field;
vector<fre_t> fre;


void field_init(int w, int h)
{
	field.clear();
	field.resize(h+1);
	for(int y=0;y<=h;y++)
	{
		field[y].resize(w+1);
	}
}


void solve(ll& result, vector<int>& result_item, vector<int>& item)
{
	do
	{
		field_init(w, h);
		field[0][0]=1;
		for(int i=0;i<k;i++)
		{
			if(item[i]==0) field[fre[i].y][fre[i].x]=-1;
		}
		for(int y=0;y<=h;y++)
		{
			for(int x=0;x<=w;x++)
			{
				if(field[y][x]<0) continue;

				if(x>0 && field[y  ][x-1]>=0) field[y][x]+=field[y  ][x-1];
				if(y>0 && field[y-1][x  ]>=0) field[y][x]+=field[y-1][x  ];
			}
		}
		if(result<field[h][w])
		{
			result=field[h][w];
			result_item=item;
		}
	}
	while(next_permutation(item.begin(), item.end()));
}


int main(void)
{
	ll result;
	vector<int> result_item;
	vector<int> item;

	while(scanf("%d%d%d%d", &w, &h, &k, &p)==4)
	{
		fre.resize(k);
		item.resize(k);
		for(int i=0;i<k;i++)
		{
			scanf("%d%d%s", &fre[i].x, &fre[i].y, fre[i].name);
		}
		for(int i=0;i<k;i++)
		{
			item[i]=((k-i)<=p);
		}
		result=0;
		result_item=item;
		solve(result, result_item, item);

		printf("%lld\n", result%1000000007);
		if(result>0)
		{
			for(int i=0;i<k;i++)
			{
				if(result_item[i]) printf("%s\n", fre[i].name);
			}
		}
	}

	return 0;
}