#include <bits/stdc++.h>
using namespace std;
map<pair<int, int>, int> h;
int dir(int first) {
  if (!first) return 0;
  return first > 0 ? 1 : -1;
}
int main() {
  h[pair<int, int>(0, 1)] = 0;
  h[pair<int, int>(1, 0)] = 1;
  h[pair<int, int>(0, -1)] = 2;
  h[pair<int, int>(-1, 0)] = 3;
  h[pair<int, int>(1, 1)] = 0;
  h[pair<int, int>(1, -1)] = 1;
  h[pair<int, int>(-1, -1)] = 2;
  h[pair<int, int>(-1, 1)] = 3;
  pair<int, int> A, B, C;
  scanf("%d%d", &A.first, &A.second);
  scanf("%d%d", &B.first, &B.second);
  scanf("%d%d", &C.first, &C.second);
  int Dab = h[pair<int, int>(dir(B.first - A.first), dir(B.second - A.second))],
      Dbc = h[pair<int, int>(dir(C.first - B.first), dir(C.second - B.second))];
  if ((Dab + 1) % 4 == Dbc)
    puts("RIGHT");
  else if ((Dab + 2) % 4 == Dbc)
    puts("BACK");
  else if ((Dab + 3) % 4 == Dbc)
    puts("LEFT");
  else if (Dab == Dbc)
    puts("TOWARDS");
  return 0;
}
