#include <bits/stdc++.h>
using namespace std;
long long GCD(long long A, long long B) {
  if (B == 0)
    return A;
  else
    return GCD(B, A % B);
}
long long modularExponentiation(long long x, long long n, long long M) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
long long bE(long long x, long long n) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = result * x;
    x = x * x;
    n = n / 2;
  }
  return result;
}
long long modInverse(long long A, long long M) {
  return modularExponentiation(A, M - 2, M);
}
vector<long long> factorize(long long n) {
  vector<long long> res;
  for (long long i = 2; i * i <= n; ++i) {
    while (n % i == 0) {
      res.push_back(i);
      n /= i;
    }
  }
  if (n != 1) {
    res.push_back(n);
  }
  return res;
}
int main() {
  long long Xa, Ya, Xb, Yb, Xc, Yc;
  cin >> Xa >> Ya;
  cin >> Xb >> Yb;
  cin >> Xc >> Yc;
  long long AB = (Xb - Xa) * (Yc - Ya);
  long long AC = (Yb - Ya) * (Xc - Xa);
  long long BC = AC - AB;
  if (BC == 0)
    cout << "TOWARDS" << endl;
  else if (BC < 0)
    cout << "LEFT" << endl;
  else if (BC > 0)
    cout << "RIGHT" << endl;
}
