#include <bits/stdc++.h> using namespace std; #define endl '\n' #define int long long #define ll long long #define ull unsigned long long #define lb lower_bound #define ub upper_bound #define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0) int gcd(int a, int b){ return __gcd(a, b); } int lcm(int a, int b){ return a / gcd(a, b) * b; } int dx[] = {-1, 1, 0, 0}; int dy[] = {0, 0, -1, 1}; void solve(){ int n, m, k; cin >> n >> m >> k; string arr[m + 5]; for (int i = 0; i < m + 5; i++)arr[i] = "?"; set<int> st; vector<pair<int, int>> vt; for (int i = 1; i <= k; i++ ){ string s; cin >> s; int a = s[0] - '0', b = s[2] - '0'; char c = s[1]; if(c == '<'){ arr[a] = "K1"; arr[b] = "K2"; st.insert(a); } else{ vt.push_back({a, b}); } } for (pair<int, int> i : vt){ if(st.count(i.first) || st.count(i.second)){ arr[i.first] = "K1"; arr[i.second] = "K1"; } else{ if(arr[i.first] != "?" || arr[i.second] != "?"){ arr[i.first] = "K1"; arr[i.second] = "K1"; } else{ arr[i.first] = "K2"; arr[i.second] = "K2"; } } } for (int i = 1; i <= m; i++)cout << arr[i] << endl; } signed main(){ IOS; int t = 1; //cin >> t; while (t--){ solve(); } }