//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  if (a < b) {
    return b - a;
  } else {
    return a - b;
  }
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a) {
    a = b;
  }
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b) {
    a = b;
  }
}
template <class F> class fix_point : private F {
public:
  explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) make_fix(F &&f) {
  return fix_point<F>(std::forward<F>(f));
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>

namespace n91 {

void solve2(const usize n, const usize m) {
  if (n == 2) {
    std::cout << "-1" << std::endl;
    return;
  }
  std::vector<char> ans(m + 1);
  usize s = 2;
  usize e0 = 0, e1 = 1;
  usize last = m;
  for (const usize i : rep(0, m)) {
    const usize x = scan<usize>() - 1;
    const usize y = scan<usize>() - 1;
    if (x == s) {
      if (y == e0) {
        ans[last] = 'v';
        last = i;
        std::tie(s, e0, e1) = std::make_tuple(e1, s, e0);
      } else if (y == e1) {
        ans[last] = '^';
        last = i;
        std::tie(s, e0, e1) = std::make_tuple(e0, s, e1);
      } else {
        ans[i] = '^';
      }
    } else if (x == e0) {
      if (y == s) {
        ans[last] = 'v';
        last = i;
        std::tie(s, e0, e1) = std::make_tuple(e1, e0, s);
      } else if (y == e1) {
        ans[last] = '^';
        last = i;
        std::tie(s, e0, e1) = std::make_tuple(s, e0, e1);
      } else {
        ans[i] = '^';
      }
    } else if (x == e1) {
      if (y == s) {
        ans[last] = '^';
        last = i;
        std::tie(s, e0, e1) = std::make_tuple(e0, e1, s);
      } else if (y == e0) {
        ans[last] = '^';
        last = i;
        std::tie(s, e0, e1) = std::make_tuple(s, e1, e0);
      } else {
        ans[i] = '^';
      }
    } else {
      ans[i] = 'v';
    }
  }
  ans[last] = '^';
  for (const usize i : rep(0, m)) {
    std::cout << ans[i];
  }
}

void main_() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  using bs = std::bitset<50000>;
  const usize n = scan<usize>();
  const usize m = scan<usize>();
  if (scan<usize>() == 2) {
    solve2(n, m);
    return;
  }
  bs temp2;
  for (const auto i : rep(n, 50000)) {
    temp2.set(i);
  }
  std::vector<bs> v(n, temp2);
  for (const usize i : rep(0, n)) {
    v[i].set(i);
  }
  std::vector<usize> x(m), y(m);
  for (const usize i : rep(0, m)) {
    std::cin >> x[i] >> y[i];
    x[i] -= 1;
    y[i] -= 1;
    v[x[i]] |= v[y[i]];
    v[y[i]] = v[x[i]];
  }
  usize w = n;
  for (const usize i : rep(0, n)) {
    if (v[i].all()) {
      w = i;
      break;
    }
  }
  if (w == n) {
    std::cout << "-1" << std::endl;
    return;
  }
  bs temp;
  temp.set(w);
  std::vector<char> ans(m);
  for (const usize i : revrep(0, m)) {
    if (temp.test(x[i])) {
      temp.set(y[i]);
      ans[i] = '^';
    } else {
      ans[i] = 'v';
      if (temp.test(y[i]))
        temp.set(x[i]);
    }
  }
  for (const auto e : ans)
    std::cout << e;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 307456