// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 21, MAXM = 21;
const int MAXS = (1 << 20) + 5;
const int MOD = 1e9 + 7;

int N, M, K;
int mask[MAXM][MAXN];

void input()
{
    read(N); read(M); read(K);
    for (int i = 1; i <= M; ++i) {
        for (int j = 0; j < N; ++j) {
            mask[i][j] = 3;
        }
    }
    for (int i = 1; i <= K; ++i) {
        int a, b, c;
        read(a); read(b); read(c);
        mask[a][b - 1] = 1 << c;
    }
}

inline int exlowbit(int x)
{
    return x ^ (x & -x);
}

void solve()
{
    static int dp[MAXN][MAXS];
    int sbnd = 1 << N;

    dp[N - 1][0] = 1;
    for (int i = 1; i <= M; ++i) {
        memcpy(dp[0], dp[N - 1], sizeof(dp[0]));
        for (int j = 0; j < N - 1; ++j) {
            memset(dp[j + 1], 0, sizeof(dp[j + 1]));
            for (int s = 0; s < sbnd; ++s) {
                if (!dp[j][s])
                    continue;
                if ((mask[i][j] & 1) && !(s >> j & 1))
                    (dp[j + 1][s] += dp[j][s]) %= MOD;
                if (mask[i][j] & 2) {
                    int t = 1 << j;
                    (dp[j + 1][exlowbit(s & ~(t - 1)) | (s & (t - 1)) | t] += dp[j][s]) %= MOD;
                }
            }
        }
    }

    int ans = 0;
    for (int s = 0; s < sbnd; ++s) {
        (ans += dp[N - 1][s]) %= MOD;
    }

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();
}

// 湘江两岸花木深，美人不见愁人心。
//     -- 卢仝《有所思》


Measured memory_bytes: 84224