#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
    std::chrono::system_clock::time_point ttt;
    void tic() { ttt = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - ttt)); }
    std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
    };
}
MaiScanner scanner;




int height, width, kei, pe;



string friends[16];

ll best;
int bits;

int hx[20];
int hy[20];

bool habit[40][40];

ll calc() {
    vector<ll> dp1(width + 1, 0);

    dp1[1] = 1;
    for (int x = 2; x <= width; ++x) {
        if (!habit[1][x])
            dp1[x] = dp1[x - 1];
    }

    for (int y = 2; y <= height; ++y) {
        vector<ll> dp2(width + 1, 0);
        
        for (int x = 1; x <= width; ++x) {
            if (!habit[x][y])
                dp2[x] = dp1[x] + dp2[x - 1];
        }
        dp1.swap(dp2);
    }
    return dp1[width];
}


int bitcount(int b) {
    return b ? bitcount(b >> 1) + (b&1) : 0;
}

int main() {
    scanner >> height >> width >> kei >> pe;
    ++height; ++width;

    repeat(kei) {
        int x, y;
        scanner >> x >> y >> friends[cnt];
        hx[cnt] = ++x;
        hy[cnt] = ++y;
        habit[y][x] = 1;
    }

    ll best = 0;
    int bestbit = 0;

    for (int bit = 0; bit < (1 << (kei)); ++bit) {
        if (bitcount(bit) == pe) {
            for (int b = bit, i = 0; b; b >>= 1, ++i) {
                if (b & 1) {
                    habit[hy[i]][hx[i]] = 0;
                }
            }
            
            ll c = calc();
            if (best < c) {
                best = c;
                bestbit = bit;
            }

            for (int b = bit, i = 0; b; b >>= 1, ++i) {
                if (b & 1) {
                    habit[hy[i]][hx[i]] = 1;
                }
            }
        }
    }

    cout << (best%MD) << endl;

    for (int b = bestbit, i = 0; b; b >>= 1, ++i) {
        if (b & 1) {
            cout << friends[i] << endl;
        }
    }

    return 0;
}