import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}
	
	final long MOD=(long)1e9+7;
	
	long f(int H,int W,int[] x,int[] y,int s) {
		int K=x.length;
		int[][] dp=new int[H+2][W+2];
		boolean[][] banned=new boolean[H+2][W+2];
		for (int i=0;i<K;++i) {
			if ((s>>i)%2==0) banned[x[i]][y[i]]=true;
		}
		dp[0][0]=1;
		for (int i=0;i<=H;++i) {
			for (int j=0;j<=W;++j) {
				if (!banned[i+1][j]) dp[i+1][j]+=dp[i][j];
				if (!banned[i][j+1]) dp[i][j+1]+=dp[i][j];
			}
		}
		return dp[H][W];
	}
	
	void run() {
		// combinatino(31+31,31)=465428353255261088<1e18
		
		FastScanner sc=new FastScanner();
		
		int H=sc.nextInt();
		int W=sc.nextInt();
		int K=sc.nextInt();//フレンズの数
		int P=sc.nextInt();//ジャパリマンの数
		int[] x=new int[K];
		int[] y=new int[K];
		String[] name=new String[K];
		for (int i=0;i<K;++i) {
			x[i]=sc.nextInt();
			y[i]=sc.nextInt();
			name[i]=sc.next();
		}
		int ans=-1;
		long pat=0;
		for (int s=0;s<1<<K;++s) {
			if (Integer.bitCount(s) > P) continue;
			long pat_cur=f(H,W,x,y,s);
			if (pat<pat_cur) {
				pat=pat_cur;
				ans=s;
			}
		}
		System.out.println(pat%MOD);
		for (int i=0;i<K;++i) {
			if ((ans>>i)%2==1) System.out.println(name[i]);
		}
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}