#define _GLIBCXX_DEBUG
#include<iostream>
#include<iomanip>
#include<string>
#include<cstdlib>
#include<vector>
#include<algorithm>
#include<queue>
#include<ctime>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(n);i++)

constexpr double et = 1.8;

int N = 30;
int Si, Sj, Ti, Tj;

int main() {
  srand(time(nullptr));
  int ti = clock();
  
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  vector<double> est_D(N * N * N * N, 0);
  vector<double> checked_num(N * N * N * N, 0);
  
  double epsilon = 1;
  
  rep(qi, 1000) {
    // init start
    
    cin >> Si >> Sj >> Ti >> Tj;
    
    // init end
    
  //   double cur_time = (double)(clock() - ti) / CLOCKS_PER_SEC;
  //   while (cur_time < et) {
  //     
  //     // main loop start
  //     
  //     
  //     // main loop end
  //     
  //     cur_time = (double)(clock() - ti) / CLOCKS_PER_SEC;
  //   }
    
    vector<char> output;
    
    priority_queue<pair<int, int>> Q;
    vector<int> color(N * N, 0);
    vector<int> dist(N * N, 1 << 28);
    vector<int> prev_dir(N * N, '.');
    vector<int> prev_u(N * N, -1);
    Q.emplace(0, Si * N + Sj);
    dist[Si * N + Sj] = 0;
    while (!Q.empty()) {
      auto [d, u] = Q.top(); Q.pop();
      if (-d > dist[u]) continue;
      if (color[u] == 1) continue;
      color[u] = 1;
      if (u == Ti * N + Tj) break;
      vector<pair<int, char>> next_vs;
      if (u % N > 0) next_vs.emplace_back(u - 1, 'L');
      if (u % N < N - 1) next_vs.emplace_back(u + 1, 'R');
      if (u / N > 0) next_vs.emplace_back(u - N, 'U');
      if (u / N < N - 1) next_vs.emplace_back(u + N, 'D');
      for (auto [next_v, dir_char] : next_vs) {
        int cur_edge = min(u, next_v) * N * N + max(u, next_v);
        int edge_cost = est_D[cur_edge] / (checked_num[cur_edge] + 0.001);
        if (color[next_v] == 0 && dist[next_v] > -d + edge_cost) {
          dist[next_v] = -d + edge_cost;
          prev_dir[next_v] = dir_char;
          prev_u[next_v] = u;
          Q.emplace(-dist[next_v], next_v);
        }
      }
    }
    vector<int> edges;
    int U = Ti * N + Tj;
    while (U != Si * N + Sj) {
      output.emplace_back(prev_dir[U]);
      edges.emplace_back(min(U, prev_u[U]) * N * N + max(U, prev_u[U]));
      U = prev_u[U];
    }
    reverse(output.begin(), output.end());
    
    // output start
    
    cout << string(output.begin(), output.end()) << endl;
    
    // output end
    
    int e;
    cin >> e;
    double new_est_D = (double) e / edges.size();
    for (int edge : edges) {
      if (edge / (N * N) + 1 == edge % (N * N)) {
        int i = edge / N % N;
        rep(j, N - 1) {
          double factor = 1 / (abs(edge % N - (j + 1)) / 10 + 1);
          int edge2 = (i * N + j) * N * N + (i * N + j + 1);
          est_D[edge2] += factor * new_est_D;
          checked_num[edge2] += factor;
        }
      } else {
        int j = edge % N;
        rep(i, N - 1) {
          double factor = 1 / (abs(edge / N % N - (i + 1)) / 10 + 1);
          int edge2 = (i * N + j) * N * N + (i * N + j + N);
          est_D[edge2] += factor * new_est_D;
          checked_num[edge2] += factor;
        }
      }
    }
    epsilon = epsilon * 0.996;
  }
}
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#ifdef NDEBUG
  #define assert(e) if(!(e)){stod("");}
#endif
#ifdef ONLINE_JUDGE
  #define debug(x)
  #define debug2(x,y)
  #define debug3(x,y,z)
#else
  #define debug(x) std::cerr<<#x<<": "<<x<<"\n"
  #define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
  #define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"
#endif

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

void solve() {
  int a, b, c;
  scan(a, b, c);
  if ((0 <= a and 0 <= b) or c % 2 == 0) {
    a = max(a, -a);
    b = max(b, -b);
    if (a < b) {
      print("<");
    } else if (a > b) {
      print(">");
    } else {
      print("=");
    }
  } else if (a < 0 and 0 <= b) {
    print("<");
  } else if (b < 0 and 0 <= a) {
    print(">");
  } else {
    if (-a < -b) {
      print("<");
    } else if (-a > -b) {
      print(">");
    } else {
      print("=");
    }
  }
}

int main() {
  solve();
  return 0;
}
