using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;

namespace AtCorder
{
	public class Program
	{
		static void Main(string[] args)
		{
			var cin = new Scanner2();
			int n = cin.Int();
			int m = cin.Int();
			int t = cin.Int();
			var xy = new Tuple<int, int>[m];
			for (int i = 0; i < m; i++) {
				int x = cin.Int() - 1;
				int y = cin.Int() - 1;
				xy[i] = new Tuple<int, int>(x, y);
			}

			if (t == 1) {
				var bits = new Bitset[n];
				for (int i = 0; i < n; i++) {
					bits[i] = new Bitset(n);
				}

				for (int i = 0; i < n; i++) {
					bits[i][i] = true;
				}

				for (int i = m - 1; i >= 0; i--) {
					bits[xy[i].Item1] |= bits[xy[i].Item2];
					bits[xy[i].Item2] = bits[xy[i].Item1];
				}

				var flags = bits[0];
				for (int i = 1; i < n; i++) {
					flags &= bits[i];
				}

				int index = -1;
				for (int i = 0; i < n; i++) {
					if (flags[i]) {
						index = i;
						break;
					}
				}

				if (index == -1) {
					Console.WriteLine(-1);
					return;
				}

				char[] ds = new char[m];
				bool[] f = new bool[n];
				f[index] = true;
				for (int i = m - 1; i >= 0; i--) {
					if (f[xy[i].Item1] && f[xy[i].Item2] == false) {
						ds[i] = '^';
					} else if (f[xy[i].Item1] == false && f[xy[i].Item2]) {
						ds[i] = 'v';
					} else {
						ds[i] = '^';
					}

					f[xy[i].Item1] |= f[xy[i].Item2];
					f[xy[i].Item2] = f[xy[i].Item1];
				}

				string ans = new string(ds);
				Console.WriteLine(ans);
			} else {
				var dsts = new int[n];
				var counts = new int[n];
				for (int i = 0; i < n; i++) {
					dsts[i] = i;
					counts[i] = 1;
				}

				char[] ds = new char[m];
				for (int i = m - 1; i >= 0; i--) {
					int dstX = dsts[xy[i].Item1];
					int dstY = dsts[xy[i].Item2];

					if (counts[dstX] > 1) {
						ds[i] = 'v';
						counts[dstX]--;
						counts[dstY]++;
						dsts[xy[i].Item1] = dstY;
					} else if (counts[dstY] > 1) {
						ds[i] = '^';
						counts[dstX]++;
						counts[dstY]--;
						dsts[xy[i].Item2] = dstX;
					} else {
						ds[i] = '^';
						counts[dstX]++;
						counts[dstY]--;
						dsts[xy[i].Item2] = dstX;
					}
				}

				int num = counts.Where(x => x >= 1).Count();
				if (num <= 1) {
					Console.WriteLine(-1);
					return;
				}

				string ans = new string(ds);
				Console.WriteLine(ans);
			}
		}
	}

	public class Bitset
	{
		private readonly int length_;
		private readonly ulong[] bits_;

		public int Size { get; }
		public Bitset(int size, bool fillTrue = false)
		{
			Size = size;
			length_ = ((size - 1) >> 6) + 1;
			bits_ = new ulong[length_];
			if (fillTrue) {
				int y = size % 64;
				if (y == 0) {
					for (int i = 0; i < length_; i++) {
						bits_[i] = ulong.MaxValue;
					}
				} else {
					for (int i = 0; i < length_ - 1; i++) {
						bits_[i] = ulong.MaxValue;
					}

					bits_[length_ - 1] = (1UL << y) - 1;
				}
			}
		}
		public Bitset(int size, long initialValue)
		{
			Size = size;
			length_ = ((size - 1) >> 6) + 1;
			bits_ = new ulong[length_];
			bits_[0] = (ulong)initialValue;
		}

		public bool this[int i]
		{
			get { return ((bits_[i >> 6] >> i) & 1) != 0; }
			set { bits_[i >> 6] = (bits_[i >> 6] & (ulong.MaxValue ^ (1ul << i))) | ((ulong)(value ? 1 : 0) << i); }
		}

		public static Bitset operator &(Bitset lhs, Bitset rhs)
		{
			int min = Math.Min(lhs.length_, rhs.length_);

			var ret = new Bitset(Math.Max(lhs.Size, rhs.Size));
			for (int i = 0; i < min; i++) {
				ret.bits_[i] = lhs.bits_[i] & rhs.bits_[i];
			}

			return ret;
		}
		public static Bitset operator |(Bitset lhs, Bitset rhs)
		{
			int max = Math.Max(lhs.length_, rhs.length_);
			int min = Math.Min(lhs.length_, rhs.length_);
			var ret = new Bitset(Math.Max(lhs.Size, rhs.Size));

			for (int i = 0; i < min; i++) {
				ret.bits_[i] = lhs.bits_[i] | rhs.bits_[i];
			}

			if (lhs.length_ > rhs.length_) {
				for (int i = min; i < max; i++) {
					ret.bits_[i] = lhs.bits_[i];
				}
			} else {
				for (int i = min; i < max; i++) {
					ret.bits_[i] = rhs.bits_[i];
				}
			}

			return ret;
		}
		public static Bitset operator ^(Bitset lhs, Bitset rhs)
		{
			int max = Math.Max(lhs.length_, rhs.length_);
			int min = Math.Min(lhs.length_, rhs.length_);
			var ret = new Bitset(Math.Max(lhs.Size, rhs.Size));

			for (int i = 0; i < min; i++) {
				ret.bits_[i] = lhs.bits_[i] ^ rhs.bits_[i];
			}

			if (lhs.length_ > rhs.length_) {
				for (int i = min; i < max; i++) {
					ret.bits_[i] = lhs.bits_[i];
				}
			} else {
				for (int i = min; i < max; i++) {
					ret.bits_[i] = rhs.bits_[i];
				}
			}

			return ret;
		}
		public static Bitset operator <<(Bitset target, int shift)
		{
			var ret = new Bitset(target.Size);
			if (shift > target.length_ << 6) {
				return ret;
			}

			int minIndex = (shift + 63) >> 6;
			if (shift % 64 == 0) {
				for (int i = target.length_ - 1; i >= minIndex; i--) {
					ret.bits_[i] = target.bits_[i - minIndex];
				}
			} else {
				for (int i = target.length_ - 1; i >= minIndex; i--) {
					ret.bits_[i] = (target.bits_[i - minIndex + 1] << shift)
						| (target.bits_[i - minIndex] >> (64 - shift));
				}

				ret.bits_[minIndex - 1] = target.bits_[0] << shift;
			}

			return ret;
		}
		public static Bitset operator >>(Bitset target, int shift)
		{
			var ret = new Bitset(target.Size);
			if (shift > target.length_ << 6) {
				return ret;
			}

			int minIndex = (shift + 63) >> 6;
			if (shift % 64 == 0) {
				for (int i = 0; i + minIndex < ret.length_; i++) {
					ret.bits_[i] = target.bits_[i + minIndex];
				}
			} else {
				for (int i = 0; i + minIndex < ret.length_; i++) {
					ret.bits_[i] = (target.bits_[i + minIndex - 1] >> shift)
						| (target.bits_[i + minIndex] << (64 - shift));
				}

				ret.bits_[ret.length_ - minIndex] = target.bits_[ret.length_ - 1] >> shift;
			}

			return ret;
		}
		public static bool operator ==(Bitset lhs, Bitset rhs)
		{
			int max = Math.Max(lhs.length_, rhs.length_);
			int min = Math.Min(lhs.length_, rhs.length_);
			for (int i = 0; i < min; i++) {
				if (lhs.bits_[i] != rhs.bits_[i]) {
					return false;
				}
			}

			if (lhs.length_ > rhs.length_) {
				for (int i = min; i < max; i++) {
					if (lhs.bits_[i] != 0) {
						return false;
					}
				}
			} else {
				for (int i = min; i < max; i++) {
					if (rhs.bits_[i] != 0) {
						return false;
					}
				}
			}

			return true;
		}
		public static bool operator !=(Bitset lhs, Bitset rhs)
		{
			return !(lhs == rhs);
		}
		public override bool Equals(object obj)
		{
			return false;
		}

		public override int GetHashCode()
		{
			var hashCode = -723801931;
			hashCode = hashCode * -1521134295 + length_.GetHashCode();
			hashCode = hashCode * -1521134295 + EqualityComparer<ulong[]>.Default.GetHashCode(bits_);
			hashCode = hashCode * -1521134295 + Size.GetHashCode();
			return hashCode;
		}

		public override string ToString()
		{
			string ret = "";
			for (int i = 0; i < length_ - 1; i++) {
				string temp = Convert.ToString((long)bits_[i], 2);
				temp = (64 > temp.Length ? new string('0', 64 - temp.Length) : "")
					+ temp;
				ret = temp + ret;
			}

			{
				string temp = Convert.ToString((long)bits_[length_ - 1], 2);
				temp = ((Size % 64) > temp.Length ? new string('0', (Size % 64) - temp.Length) : "")
					+ temp;
				ret = temp + ret;
			}

			return ret;
		}
	}

	public class Scanner2
	{
		private readonly char[] delimiter_ = new char[] { ' ' };
		private readonly string filePath_;
		private string[] buf_;
		private int index_;
		Func<string> reader_;

		public Scanner2(string file = "")
		{
			if (string.IsNullOrWhiteSpace(file)) {
				reader_ = Console.ReadLine;
			} else {
				filePath_ = file;
				var fs = new StreamReader(file);
				reader_ = fs.ReadLine;
			}
			buf_ = new string[0];
			index_ = 0;
		}

		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}

			string st = reader_();
			while (st == "") {
				st = reader_();
			}

			buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}

			index_ = 0;
			return buf_[index_++];
		}

		public int Int() => int.Parse(Next());
		public long Long() => long.Parse(Next());
		public double Double() => double.Parse(Next());

		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Int() + add;
			}
			return Array;
		}

		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Long() + add;
			}
			return Array;
		}

		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Double() + add;
			}
			return Array;
		}

		public void Save(string text)
		{
			if (string.IsNullOrWhiteSpace(filePath_)) {
				return;
			}

			File.WriteAllText(filePath_ + "_output.txt", text);
		}
	}
}

Measured memory_bytes: 618324