A flock of chickens are running east along a straight, narrow road. Each one is running with its own constant speed. Whenever a chick catches up to the one in front of it, it has to slow down and follow at the speed of the other chick. You are in a mobile crane behind the flock, chasing the chicks towards the barn at the end of the road. The arm of the crane allows you to pick up any chick momentarily, let the chick behind it pass underneath and place the picked up chick back down. This operation takes no time and can only be performed on a pair of chicks that are immediately next to each other, even if 3 or more chicks are in a row, one after the other.
Given the initial locations (X_{i}) at time 0 and natural speeds (V_{i}) of the chicks, as well as the location of the barn (B), what is the minimum number of swaps you need to perform with your crane in order to have at least K of the N chicks arrive at the barn no later than time T?
You may think of the chicks as points moving along a line. Even if 3 or more chicks are at the same location, next to each other, picking up one of them will only let one of the other two pass through. Any swap is instantaneous, which means that you may perform multiple swaps at the same time, but each one will count as a separate swap.
The first line of the input gives the number of test cases, C. C test cases follow. Each test case starts with 4 integers on a line  N, K, B and T. The next line contains the N different integers X_{i}, in increasing order. The line after that contains the N integers V_{i}. All distances are in meters; all speeds are in meters per second; all times are in seconds.
For each test case, output one line containing "Case #x: S", where x is the case number (starting from 1) and S is the smallest number of required swaps, or the word "IMPOSSIBLE".
1 ≤ C ≤ 100;
1 ≤ B ≤ 1,000,000,000;
1 ≤ T ≤ 1,000;
0 ≤ X_{i} < B;
1 ≤ V_{i} ≤ 100;
All the X_{i}'s will be distinct and in increasing order.
1 ≤ N ≤ 10;
0 ≤ K ≤ min(3, N);
1 ≤ N ≤ 50;
0 ≤ K ≤ N;
Input 
Output 
3

Case #1: 0
