/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1e6+10;
char an[SIZE];
PII nxt[SIZE];
int x[SIZE],y[SIZE];
PII trans(PII now,int v1,int v2){
    if(now.F==v1)now.F=v2;
    if(now.S==v1)now.S=v2;
    if(now.F>now.S)swap(now.F,now.S);
    return now;
}
bitset<50001>AA[50001];
bool u[50001];
void track(int M,int st){
    u[st]=1;
    for(int i=M-1;i>=0;i--){
        if(u[x[i]]){
            an[i]='^';
            u[y[i]]=1;
        }
        else {
            an[i]='v';
            if(u[y[i]])u[x[i]]=1;
        }
    }
    W(an);
}
int main(){
    int N,M,T;
    R(N,M,T);
    if(T==1){
        FOR(i,1,N)AA[i][i]=1;
        REP(i,M){
            R(x[i],y[i]);
            AA[x[i]]|=AA[y[i]];
            AA[y[i]]|=AA[x[i]];
        }
        FOR(i,1,N){
            if((int)AA[i].count()==N){
                track(M,i);
                return 0;
            }
        }
        W(-1);
    }
    if(T==2){
        if(N==2)W(-1);
        else{
            REP(i,M){
                R(x[i],y[i]);
                if(x[i]>3)an[i]='^';
                else if(y[i]>3)an[i]='^';
            }
            PII now={1,2};
            for(int i=M-1;i>=0;i--){
                if(!an[i]){
                    nxt[i]=now;
                    now=MP(x[i],y[i]);
                }
            }
            if(now==MP(1,2))now.S++;
            else if(now==MP(1,3))now.F++;
            else now.F--;
            REP(i,M){
                if(!an[i]){
                    if(trans(now,x[i],y[i])!=nxt[i]){
                        an[i]='v';
                        now=trans(now,x[i],y[i]);
                    }
                    else{
                        an[i]='^';
                        now=trans(now,y[i],x[i]);
                    }
                }
            }
            W(an);
        }
    }
    return 0;
}


Measured memory_bytes: 311680