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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define alls(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int main(int argc, char const* argv[])
{
  int n, m, t; cin >> n >> m >> t;
  vector<int> x(m), y(m); rep(i, m)cin >> x[i] >> y[i], x[i]--, y[i]--;
  if(t == 1){
    bitset<50000> bsi;
    FOR(i, n, 50000)bsi.set(i);
    vector<bitset<50000>> bs(n, bsi);
    rep(i, n)bs[i].set(i);
    rrep(i, m){
      bs[x[i]] |= bs[y[i]];
      bs[y[i]] = bs[x[i]];
    }
    int idx = -1;
    FOR(i, 1, n)bs[0] &= bs[i];
    rep(i, n){
      if(bs[0][i]){
        idx = i;
        break;
      }
    }
    if(idx == -1){
      cout << -1 << endl;
      return 0;
    }
    string s = "";
    bitset<50000> bt; bt.set(idx);
    rrep(i, m){
      if(bt[x[i]]){
        bt.set(y[i]);
        s += "^";
      }else{
        if(bt[y[i]])bt.set(x[i]);
        s += "v";
      }
    }
    reverse(alls(s));
    cout << s << endl;
  }else{
    if(n == 2){
      cout << -1 << endl;
      return 0;
    }
    vector<int> cnt(n, 1);
    vector<int> b(n); rep(i, n)b[i] = i;
    string s = "";
    rrep(i, m){
      if(cnt[b[x[i]]] > 1){
        cnt[b[x[i]]]--;
        cnt[b[y[i]]]++;
        b[x[i]] = b[y[i]];
        s += "v";
      }else{
        cnt[b[y[i]]]--;
        cnt[b[x[i]]]++;
        b[y[i]] = b[x[i]];
        s += "^";
      }
    }
    reverse(alls(s));
    cout << s << endl;
  }
  return 0;
}


Measured memory_bytes: 306944