#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int getInt() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 50001;
random_device _rd;
struct xrand {
  static const uint64_t _x = 88172645463325252ull;
  uint64_t x;
  xrand(): x(_x ^ (_rd()+time(0))) {}
  xrand(uint64_t seed): x(_x ^ seed) {}
  uint64_t get() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  int operator()(int n) { return get()%n;}
  int operator()(int l, int r) { return get()%(r-l+1) + l;}
} rnd;

typedef bitset<MX> bs;
bs d[MX];

int main() {
  int n,m;
  scanf("%d%d",&n,&m);
  int TESTCASE;
  scanf("%d",&TESTCASE);
  vp p(m);
  cin>>p;
  rep(i,m) p[i].fi--;
  rep(i,m) p[i].se--;
  if (TESTCASE == 1) {
    rep(i,n) d[i][i] = 1;
    rep(i,m) {
      int a = p[i].fi, b = p[i].se;
      d[a] |= d[b];
      d[b] = d[a];
    }
    int t = -1;
    rep(i,n) if (d[i].count() == n) t = i;
    if (t == -1) dame;
    vi x(n);
    x[t] = 1;
    string ans(m,'v');
    drep(i,m) {
      int a = p[i].fi, b = p[i].se;
      if (!x[b]) {
        ans[i] = '^';
        x[b] = x[a];
      } else {
        x[a] |= x[b];
      }
    }
    cout<<ans<<endl;
  } else {
    string ans(m,'^');
    if (n == 2) dame;
    vp x;
    rep(i,m) {
      int a = p[i].fi, b = p[i].se;
      if (a < 3) {
        if (b < 3) {
          x.eb(a+b,i);
        }
      }
    }
    int pre = 0;
    drep(xi,sz(x)) {
      int i = x[xi].se;
      int t = x[xi].fi;
      int a = 0, b = 1;
      if (t == 2) b = 2;
      if (t == 3) a = 1, b = 2;
      if (pre == b) {
        ans[i] = 'v';
      } else {
        // pre = b;
      }
      pre = 3-t;
    }
    cout<<ans<<endl;
  }
  return 0;
}






















Measured memory_bytes: 306944