【CodeForces - 227A】【 Where do I Turn? 】

题目：

Trouble came from the overseas lands: a three-headed dragon Gorynych arrived. The dragon settled at point C and began to terrorize the residents of the surrounding villages.

A brave hero decided to put an end to the dragon. He moved from point A to fight with Gorynych. The hero rode from point A along a straight road and met point B on his way. The hero knows that in this land for every pair of roads it is true that they are either parallel to each other, or lie on a straight line, or are perpendicular to each other. He also knows well that points B and C are connected by a road. So the hero must either turn 90 degrees to the left or continue riding straight ahead or turn 90 degrees to the right. But he forgot where the point C is located.

Fortunately, a Brave Falcon flew right by. It can see all three points from the sky. The hero asked him what way to go to get to the dragon's lair.

If you have not got it, you are the falcon. Help the hero and tell him how to get him to point C: turn left, go straight or turn right.

At this moment the hero is believed to stand at point B, turning his back to point A.

Input

The first input line contains two space-separated integers xa, ya (|xa|, |ya| ≤ 109)— the coordinates of point A. The second line contains the coordinates of point Bin the same form, the third line contains the coordinates of point C.

It is guaranteed that all points are pairwise different. It is also guaranteed that either point B lies on segment AC, or angle ABC is right.

Output

Print a single line. If a hero must turn left, print "LEFT" (without the quotes); If he must go straight ahead, print "TOWARDS" (without the quotes); if he should turn right, print "RIGHT" (without the quotes).

Examples

Input

0 0
0 1
1 1

Output

RIGHT

Input

-1 -1
-3 -3
-4 -4

Output

TOWARDS

Input

-4 -6
-3 -7
-2 -6

Output

LEFT

Note

The picture to the first sample:

The red color shows points A, B and C. The blue arrow shows the hero's direction. The green color shows the hero's trajectory.

The picture to the second sample:

解题报告：看着这个题目很难，看不懂系列，其实这道题目并不难，就是问a b连线到b c连线是左拐还是右拐。之前做过这种题目，只要是求两条线的叉乘就可以，判断一下方向，根据样例验证一下（主要是自己忘记了正负和左右拐的对应关系了）。

ac代码：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
typedef long long ll;
const int maxn=1e5+100;
struct point{
	ll x,y;
};

struct point a,b,c;

int main()
{
	scanf("%lld%lld",&a.x,&a.y);
	scanf("%lld%lld",&b.x,&b.y);
	scanf("%lld%lld",&c.x,&c.y);
	if((c.y-a.y)*(b.x-a.x)>(b.y-a.y)*(c.x-a.x))
		printf("LEFT\n");
	else if((c.y-a.y)*(b.x-a.x)<(b.y-a.y)*(c.x-a.x))
		printf("RIGHT\n");
	else
		printf("TOWARDS\n");
}