#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int main() {
    long long n,k, m;
    cin>> n>>k >>m;

    vector<vector<long long>> x(n, vector<long long> (2, -1));

    long long a ,b, c, d;
    vector<long long> maximalval(3, 18);
    vector<long long> minimalval(3, 0);


    for (int i = 0; i < m; ++i) {
        cin >> a >> b >>c;
        x[a][b] = c;
        int secondrow = b==1 ? 0 : 1;

        int ind = a%3;

        if (minimalval[ind] == maximalval[ind]){
            if (c + x[a][secondrow] != minimalval[ind]){
                cout<<0<<endl;
                return 0;
            }
        }
        if (x[a][secondrow] == -1){
            minimalval[ind] = max(minimalval[ind], c);
            maximalval[ind] = minimalval[ind] + 9;
        }
        else{
            minimalval[ind] = c + x[a][secondrow];
            maximalval[ind] = c + x[a][secondrow];
        }
    }

    long long res = 0;
    for (int i0 = minimalval[0]; i0 <= maximalval[0]; ++i0) {
        for (int i1 = minimalval[1]; i1 <= maximalval[1]; ++i1) {
            for (int i2 = minimalval[2]; i2 <= maximalval[2]; ++i2) {
                if (i0 + i1 + i2 != k){
                    continue;
                }
                vector<int> nic = {i0, i1, i2};

                long long actres = 1;
                for (int i = 0; i < n; ++i) {
                    int residum = i%3;
                    long long nicres = 1;
                    if(x[i][0] == -1 && x[i][1]==-1){
                        nicres = 10 - abs(9 - nic[residum]);
                    }
                    actres = (actres * nicres) % 1000000007;
                }
                //cout<< actres<<endl;

                res = (res + actres) % 1000000007;

            }
        }
    }

    std::cout << res << std::endl;
    return 0;
}