#include <bits/stdc++.h>
using namespace std;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, 1, -1, -1, 1};
const double eps = 1e-9;
const int INF = 0x7FFFFFFF;
const long long INFLL = 0x7FFFFFFFFFFFFFFFLL;
const double pi = acos(-1);
template <class T>
T take(queue<T> &O) {
  T tmp = O.front();
  O.pop();
  return tmp;
}
template <class T>
T take(stack<T> &O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
T take(priority_queue<T> &O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
inline void getint(int &num) { scanf("%d", &num); }
inline void getint(long long &num) { cin >> num; }
long long x[3], y[3];
long long cross() {
  return (x[1] - x[0]) * (y[2] - y[0]) - (x[2] - x[0]) * (y[1] - y[0]);
}
int main() {
  for (int(i) = (0), _t = (3); i < (_t); ++(i)) {
    getint(x[i]);
    getint(y[i]);
  }
  long long tmp = cross();
  if (tmp == 0LL)
    cout << "TOWARDS";
  else if (tmp > 0LL)
    cout << "LEFT";
  else
    cout << "RIGHT";
  cout << endl;
  return 0;
}
