求助！！！

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
//Mystery_Sky
//
#define M 1000100
struct node{
	int id;
	int dis;
	int turn;
	inline bool operator < (const node& a) const{
		return dis < a.dis;
	}
};
node first[M];
node end[M];
int order[M];
int n, T, L, k;
char Turn[][10] = {"L", "Turning", "R"};
int main() {
	scanf("%d", &k);
	for(int q = 1; q <= k; q++) {
		printf("Case #%d\n", q);
		scanf("%d%d%d", &L, &T, &n);
		for(int i = 1; i <= n; i++) {
			int d;
			char c;
			scanf("%d %c", &d, &c);
			int t = (c == 'R' ? 1 : -1);
			first[i] = (node) {i, d, t};
			end[i] = (node) {0, d+T*t, t};
		}
		sort(first+1, first+1+n);
		for(int i = 1; i <= n; i++) order[first[i].id] = i;
		sort(end+1, end+1+n);
		for(int i = 1; i <= n; i++) {
			if(end[i].dis == end[i+1].dis) end[i].turn = end[i+1].turn = 0;
		}
		for(int i = 1; i <= n; i++) {
			int x = order[i];
			if(end[x].dis < 0 || end[x].dis > L) printf("Fell off\n");
			else printf("%d %s\n", end[x].dis, Turn[end[x].turn+1]);
		}	
	}
	return 0;
}