//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(unordered_set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 1e6 + 10, M = 2e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
b >>= 1;
a = (a * a) % m;
}
return res;
}
__int128_t gcd(__int128_t a, __int128_t b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
__int128_t lcm(__int128_t a, __int128_t b) {
return a / gcd(a, b) * b;
}
int dist(char A, char B) {
if (A == 'A') {
if (B == 'G') return 1;
else if (B == 'C') return 2;
else if (B == 'T') return 3;
else return 0;
}
else if (A == 'G') {
if (B == 'G') return 0;
else if (B == 'C') return 1;
else if (B == 'T') return 2;
else return 3;
}
else if (A == 'C') {
if (B == 'G') return 3;
else if (B == 'C') return 0;
else if (B == 'T') return 1;
else return 2;
}
else if (A == 'T') {
if (B == 'G') return 2;
else if (B == 'C') return 3;
else if (B == 'T') return 0;
else return 1;
}
return -1;
}
int n, m, q, in[N], ans[N];
vector<int>adj[N];
vector<int> havasar[N];
bool visited[N];
void dfs(int node, int d) {
if (d == n) {
ans[node] = 1;
return;
}
for (auto i : adj[node]) {
if (ans[i]) continue;
dfs(i, d + 1);
}
set<int>res;
for (auto i : adj[node]) {
if (!ans[i]) continue;
res.insert(ans[i]);
}
if (res.size() > 1) ans[node] = -1;
else if (res.empty()) ans[node] = 0;
else ans[node] = *res.begin() + 1;
}
void dfs2(int node) {
visited[node] = 1;
for (auto i : havasar[node]) {
if (visited[i] || ans[i] || ans[i] == -1) continue;
ans[i] = ans[node];
dfs2(i);
}
}
void solve(int tc) {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++) {
int a, b;
char c;
cin >> a >> c >> b;
if (c == '=') {
havasar[a].push_back(b);
havasar[b].push_back(a);
}
else if (c == '>') {
adj[a].push_back(b);
in[b]++;
}
else {
adj[b].push_back(a);
in[a]++;
}
}
for (int i = 1; i <= m; i++) {
if (in[i]) continue;
dfs(i, 1);
}
for (int i = 1; i <= m; i++) {
if (ans[i] > 0) {
dfs2(i);
}
}
for (int i = 1; i <= m; i++) {
if (ans[i] <= 0) {
cout << "?\n";
}else{
cout << "K" << ans[i] << endl;
}
}
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
