#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define F first
#define S second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define FIO ios_base::sync_with_stdio(false); cin.tie(0)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 3e5 + 10;
int n, m, v;
int a[N];
int b[N];
char c[N];
int par2[N];
int sz2[N];
int find(int x) {
if (par2[x] == x) return x;
return par2[x] = find(par2[x]);
}
void merge(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sz2[x] < sz2[y]) swap(x, y);
par2[y] = x;
sz2[x] += sz2[y];
}
vector<int> chi[N];
vector<int> par[N];
int dj[N];
int ro[N];
int o1[N];
int o2[N];
void dfs1(int node) {
if (o1[node] != -1) return;
o1[node] = 0;
for (int x : chi[node]) {
o1[node] = max(o1[node], o1[x] + 1);
}
for (int x : par[node]) {
dj[x]--;
if (dj[x] == 0) dfs1(x);
}
}
void dfs2(int node) {
if (o2[node] != -1) return;
o2[node] = 0;
for (int x : par[node]) {
o2[node] = max(o2[node], o2[x] + 1);
}
for (int x : chi[node]) {
ro[x]--;
if (ro[x] == 0) dfs2(x);
}
}
int main() {
FIO;
memset(o1, -1, sizeof o1);
memset(o2, -1, sizeof o2);
for (int i = 0; i < N; i++) {
sz2[i] = 1;
par2[i] = i;
}
cin >> n >> m >> v;
for (int i = 0; i < v; i++) {
string s;
cin >> s;
int cur = 0;
for (char t : s) {
if ('0' <= t and t <= '9') {
cur *= 10;
cur += t - '0';
} else {
a[i] = cur;
cur = 0;
c[i] = t;
}
}
b[i] = cur;
}
for (int i = 0; i < v; i++) {
if (c[i] == '=') {
merge(a[i], b[i]);
}
}
for (int i = 0; i < v; i++) {
a[i] = find(a[i]);
b[i] = find(b[i]);
if (c[i] == '<') {
chi[b[i]].pb(a[i]);
par[a[i]].pb(b[i]);
} else if (c[i] == '>') {
chi[a[i]].pb(b[i]);
par[b[i]].pb(a[i]);
}
}
for (int i = 1; i <= m; i++) {
dj[i] = sz(chi[i]);
ro[i] = sz(par[i]);
}
for (int i = 1; i <= m; i++) {
if (find(i) != i) continue;
if (o1[i] == -1 and dj[i] == 0) {
dfs1(i);
}
if (o2[i] == -1 and ro[i] == 0) {
dfs2(i);
}
}
for (int i = 1; i <= m; i++) {
if (o1[find(i)] + o2[find(i)] == n - 1) {
cout << "K" << o1[find(i)] + 1 << '\n';
} else {
cout << "?\n";
}
}
return 0;
}
