Cow Crane

Farmer Laura has a barn with two cows, Monica and Lydia. Both cows love food and both are lazy. They spend most of the day resting in the barn, waiting for Laura to bring a meal. Laura is precise about feeding time, so the cows know exactly when the food arrives, at the same time every day.

Laura is about to replace a few planks in the barn floor, so the cows have to move to temporary spots for a while. The cows refuse to walk themselves, so Laura rented a cow crane built for the comfort of a cow.

Think of the barn as a one dimensional line. The crane starts at time $t = 0$ at position $x = 0$ and moves one unit of distance per second. It carries only one cow at a time, but it may pick up and drop off a cow as many times as necessary. Monica is at $x = m$ and Lydia is at $x = l$. Monica has to be moved to $x = M$ and Lydia to $x = L$. Monica gets her meal $t_m$ seconds into the day and Lydia gets hers $t_l$ seconds into the day, so each cow has to be at her temporary spot at her own meal time. Picking up and dropping off a cow takes no time, and the two cows may be at the same position at the same moment.

Laura wants to know whether she can get both cows to their temporary spots in time.

The first line contains two integers $m$ and $l$, the current positions of the cows. The second line contains two integers $M$ and $L$, the new positions of the cows. The third line contains two integers $t_m$ and $t_l$, the times at which the cows are served their meal. $-10^8 \le m, l, M, L \le 10^8$ and $1 \le t_m, t_l \le 10^8$. Both cows really do move, so $m \ne M$ and $l \ne L$.

Print possible if both cows can be brought to their temporary spots by their meal times. Otherwise print impossible.