#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; }
template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; }

const int N = 1e5+7;

struct Ninja {
    int l, r, t;
};

bool operator < (Ninja a, Ninja b) { // mai vedem
    return a.r - a.l <= b.r - b.l;
}

Ninja a[N];
int one[N], zero[N];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    
    int n, k, m; cin >> n >> k >> m;
    for (int i = 1; i <= m; ++i) cin >> a[i].l >> a[i].r >> a[i].t;
    
    for (int mask = 0; mask < (1 << n); ++mask) {
        if (__builtin_popcount(mask) != k) continue;
        vector<int> pref(n + 1, 0);
        for (int i = 1; i <= n; ++i) {
            bool bit = !!(mask & (1 << (i - 1)));
            pref[i] = pref[i - 1] + bit;
        }
        bool ok = 1;
        for (int i = 1; i <= m; ++i) {
            int cnt = pref[a[i].r] - pref[a[i].l - 1];
            if (cnt == 0 && a[i].t == 1) ok = 0;
            if (cnt != 0 && a[i].t == 0) ok = 0;
        }
        if (ok == 1) {
            for (int i = 1; i <= n; ++i) {
                if (mask & (1 << (i - 1))) {
                    ++one[i];
                } else {
                    ++zero[i];
                }
            }
        }
    }
    int cnt = 0;
    for (int i = 1; i <= n; ++i) {
        if (one[i] != 0 && zero[i] == 0) {
            cout << i << "\n";
            ++cnt;
        }
    }
    if (cnt == 0) cout << -1 << "\n";
}