#include <bits/stdc++.h>
using namespace std;

constexpr int kN = 50000;

int main() {
    int n, m, t; scanf("%d%d%d", &n, &m, &t);
    if (t == 1) {
        vector<bitset<kN>> bs(n);
        for (int i = 0; i < n; ++i) bs[i].set(i);
        vector<pair<int, int>> ed(m);
        for (int i = 0; i < m; ++i) {
            int u, v; scanf("%d%d", &u, &v);
            u--, v--;
            bs[u] |= bs[v];
            bs[v] |= bs[u];
            ed[i] = make_pair(u, v);
        }
        for (int i = 0; i < n; ++i) {
            if (bs[i].count() == n) {
                vector<int> ok(n);
                ok[i] = 1;
                bool fd = false;
                string ans(m, '^');
                for (int j = m - 1; j >= 0; --j) {
                    fd |= (ed[j].first == i || ed[j].second == i);
                    if (!fd) continue;
                    if (!ok[ed[j].first] && !ok[ed[j].second]) continue;
                    if (ok[ed[j].first] && ok[ed[j].second]) continue;
                    if (ok[ed[j].second]) ans[j] = 'v';
                    ok[ed[j].first] = ok[ed[j].second] = 1;
                }
                for (int j = 0; j < n; ++j) assert(ok[j]);
                printf("%s\n", ans.c_str());
                return 0;
            }
        }
        puts("-1");
    } else {
        if (n == 2) {
            puts("-1");
            return 0;
        }
        vector<pair<int, int>> ed(m);
        for (int i = 0; i < m; ++i) {
            scanf("%d%d", &ed[i].first, &ed[i].second);
            ed[i].first--;
            ed[i].second--;
        }
        vector<int> dest(n), cnt(n);
        for (int i = 0; i < n; ++i) dest[i] = i, cnt[i] = 1;
        string ans(m, '^');
        for (int i = m - 1; i >= 0; --i) {
            if (dest[ed[i].first] == dest[ed[i].second]) continue;
            if (cnt[dest[ed[i].second]] == n - 1) {
                --cnt[dest[ed[i].second]];
                dest[ed[i].second] = dest[ed[i].first];
                ++cnt[dest[ed[i].second]];
            } else {
                --cnt[dest[ed[i].first]];
                dest[ed[i].first] = dest[ed[i].second];
                ++cnt[dest[ed[i].first]];
                ans[i] = 'v';
            }
        }
        printf("%s\n", ans.c_str());
    }
    return 0;
}
