#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long int infLL = 9000000000000000000;
const long long int MOD = 1e+7;
const double PI = 3.141592653589793238462643383279;
int dx[] = {0, 0, +1, -1, +1, +1, -1, -1};
int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1};
const int lim = 2e5 + 123;
double a1, a2, a3, b2, b3, b1, k;
void case_i() {
  cin >> a1 >> b1 >> a2 >> b2 >> a3 >> b3;
  if ((b1 - b2) / (a1 - a2) == (b2 - b3) / (a2 - a3))
    cout << "TOWARDS" << endl;
  else if (a1 > a2) {
    if (b2 > b3)
      cout << "LEFT" << endl;
    else
      cout << "RIGHT" << endl;
  } else if (a1 < a2) {
    if (b2 < b3)
      cout << "LEFT" << endl;
    else
      cout << "RIGHT" << endl;
  } else if (b1 < b2) {
    if (a2 < a3)
      cout << "RIGHT" << endl;
    else
      cout << "LEFT" << endl;
  } else {
    if (a2 > a3)
      cout << "RIGHT" << endl;
    else
      cout << "LEFT" << endl;
  }
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  case_i();
  return 0;
}
long long int Pow(long long int p, long long int q) {
  long long int k = 1;
  for (long long int i = 1; i <= q; i++) k *= i;
  return k;
}
long long int fact(long long int f) {
  long long int k = 1;
  for (long long int i = 1; i <= f; i++) k *= i;
  return k;
}
bool isPrime(long long int n) {
  if (n % 2 == 0) return false;
  for (long long int i = 3; i * i <= n; i += 2)
    if (n % i == 0) return false;
  return true;
}
void sieve(long long int n, bool vis[], vector<long long int>& prime) {
  prime.push_back(2);
  for (long long int i = 3; i <= n; i += 2) {
    if (!vis[i]) {
      prime.push_back(i);
      for (long long int j = i * i; j <= n; j += (2 * i)) vis[j] = true;
    }
  }
}
void TotalDivisor(long long int a[], long long int n) {
  for (long long int i = 1; i * i <= n; i++) {
    for (long long int j = i * i; j < n; j += i) {
      if (j == i * i)
        a[j]++;
      else
        a[j] += 2;
    }
  }
}
void SumofDiv(long long int a[], long long int n) {
  for (long long int i = 1; i * i <= n; i++) {
    for (long long int j = i * i; j < n; j += i) {
      if (j == i * i)
        a[j] += i;
      else
        a[j] += i + j / i;
    }
  }
}
void dfs(long long int i, bool vis[], vector<long long int> v[]) {
  vis[i] = true;
  for (auto j : v[i]) {
    if (!vis[j]) dfs(j, vis, v);
  }
}
void bfs(long long int i, vector<long long int> v[], long long int lev[]) {
  queue<long long int> q;
  q.push(i);
  while (!q.empty()) {
    long long int u = q.front();
    q.pop();
    for (auto j : v[u])
      if (lev[j] == -1) {
        lev[j] = lev[u] + 1;
        q.push(j);
      }
  }
}
