#include <bits/stdc++.h>
using namespace std;
void insertionsort(int a[], int b[], int n) {
  int mini;
  for (int i = 0; i < n - 1; i++) {
    for (int j = n - 1; j > i; j--) {
      if (a[j] < a[j - 1]) {
        mini = a[j];
        a[j] = a[j - 1];
        a[j - 1] = mini;
        mini = b[j];
        b[j] = b[j - 1];
        b[j - 1] = mini;
      }
    }
  }
}
int main() {
  int t;
  t = 1;
  while (t--) {
    int ax, ay, bx, by, cx, cy;
    cin >> ax >> ay;
    cin >> bx >> by;
    cin >> cx >> cy;
    long long int roadx = bx - ax, roady = by - ay, desx = cx - bx,
                  desy = cy - by;
    long long int cross = roadx * desy - roady * desx;
    if (!cross)
      cout << "TOWARDS" << endl;
    else {
      if (cross > 0)
        cout << "LEFT" << endl;
      else
        cout << "RIGHT" << endl;
    }
  }
  return 0;
}
