//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <cassert>

#include <complex>

#include <cstdio>

#include <bitset>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "P(" << p.first << ", " << p.second << ")";
}

template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
    os << "[";
    for (auto d : v) os << d << ", ";
    return os << "]";
}

struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        reverse(small, small + len);
        memcpy(line + pos, small, len);
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

const int MN = 50050;
using B = bitset<MN>;

string solve1(int n, V<int> u, V<int> v) {
    int m = int(u.size());
    string s(m, '^');
    V<B> g(n);
    for (int i = 0; i < n; i++) {
        g[i].set(i);
    }

    for (int i = 0; i < m; i++) {
        B b = g[u[i]] | g[v[i]];
        g[u[i]] = g[v[i]] = b;
    }

    for (int i = 0; i < n; i++) {
        if (int(g[i].count()) != n) continue;
        V<int> vis(n);
        vis[i] = true;
        for (int j = m - 1; j >= 0; j--) {
            int a = u[j], b = v[j];
            if (vis[a]) {
                s[j] = '^';
                vis[b] = true;
            } else if (vis[b]) {
                s[j] = 'v';
                vis[a] = true;
            }
        }
        return s;
    }

    return "-1";
}

string solve2(int n, V<int> u, V<int> v) {
    int m = int(u.size());
    string s(m, '^');
    V<int> deg(n);
    for (int i = 0; i < m; i++) {
        deg[u[i]]++;
        deg[v[i]]++;
    }
    for (int i = 0; i < n; i++) {
        if (deg[i] >= n - 10) continue;
        V<int> vis(n);
        for (int j = 0; j < m; j++) {
            if (u[j] != i && v[j] != i) continue;
            vis[u[j]] = vis[v[j]] = true;
        }
        int j = -1;
        for (int _j = 0; _j < n; _j++) {
            if (!vis[_j]) j = _j;
        }
        assert(j != -1);
        for (int ph = 0; ph < m; ph++) {
            if (u[ph] == i || u[ph] == j) {
                s[ph] = '^';
            }
            if (v[ph] == i || v[ph] == j) {
                s[ph] = 'v';
            }
        }
        return s;
    }

    // n <= sqrt(m)
    VV<int> dp(n, V<int>(n));
    VV<int> flip(m, V<int>(n, -1));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            dp[i][j] = true;
        }
    }
    for (int tm = 0; tm < m; tm++) {
        int a = u[tm], b = v[tm];
        dp[a][b] = false;
        dp[b][a] = false;
        for (int i = 0; i < n; i++) {
            if (i == a || i == b) continue;
            if (dp[i][a]) flip[tm][i] = 0;
            if (dp[i][b]) flip[tm][i] = 1;
            bool f = dp[i][a] || dp[i][b];
            dp[i][a] = dp[i][b] = f;
            dp[a][i] = dp[b][i] = f;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!dp[i][j]) continue;
            for (int tm = m - 1; tm >= 0; tm--) {
                int a = u[tm], b = v[tm];
                if (a == j || b == j) {
                    swap(i, j);
                }
                if (a == i || b == i) {
                    if (a == i) {
                        s[tm] = '^';
                    } else {
                        s[tm] = 'v';
                    }
                    assert(flip[tm][j] != -1);
                    if (!flip[tm][j]) {
                        i = a;
                    } else {
                        i = b;
                    }
                }
            }
            return s;
        }
    }

    return "-1";
}

int main() {
    int n, m, t;
    sc.read(n, m, t);

    V<int> u(m), v(m);
    for (int i = 0; i < m; i++) {
        sc.read(u[i], v[i]);
        u[i]--; v[i]--;
    }

    if (t == 1) {
        cout << solve1(n, u, v) << endl;
    } else {
        cout << solve2(n, u, v) << endl;
    }
    return 0;
}


Measured memory_bytes: 307968