#include <stdio.h>  
#include <string.h>  
#include <stdlib.h>  

#define max(a, b) ((a)>(b)?(a):(b))  
enum ActiveType{Waiting, Going, Staying};  

typedef struct Active{  
	ActiveType activeType;  
	int PlaceStart;//前两位表示层数，后一位0表示刚刚到这层，1到10表示10个房间，  
	int PlaceEnd; //11表示上楼或下楼的电梯，0112表示下到底层电梯,0113表示已经出楼  
	int TimeStart;  
	int TimeOver;  
	Active *Next;  
}Active;  

int toView[35][100][100];  
int enterTime[35];  
Active Actives[35];  
Active *Status[35];//当前状态  
int now;  
int roomFree[15][100];  
Active aaaaa[200000];  
int bbbbb;  

void printRoom(int room)  
{  
	if(room%100 == 0 || room%100 == 11 || room%100 == 12)  
		printf("elevator");  
	else{  
		char tmp[100];  
		sprintf(tmp, "%2d%2d", room/100, room%100);  
		for(int i=0; i<10; i++)  
			if(tmp[i] == ' ')  
				tmp[i] = '0';  
		printf("room %s", tmp);  
	}  
}  

void printTime(int time)  
{  
	char tmp[100];  
	sprintf(tmp, "%2d:%2d:%2d", time/3600, time/60%60, time%60);  
	int i;  
	for(i=0; i<8; i++)  
		if(tmp[i] == ' ')  
			tmp[i] = '0';  
	printf("%s ", tmp);  
}  

void printnode(Active *active)  
{  
	if(active->PlaceEnd == 100 || active->TimeOver == 100000000)  
		return;  
	else{  
		printTime(active->TimeStart);  
		printTime(active->TimeOver);  
	}  
	if(active->PlaceStart == 100){  
		printf("Entry\n");  
	}  
	else if(active->PlaceEnd == 113){  
		printf("Exit\n");  
	}  
	else if(active->PlaceEnd % 100 == 0){  
		printf("Stay in elevator\n");  
	}  
	else if(active->activeType == Waiting){  
		if(active->PlaceEnd % 100 == 11)  
			printf("Waiting in elevator queue\n");  
		else{  
			printf("Waiting in front of ");  
			printRoom(active->PlaceEnd);  
			printf("\n");  
		}  
	}  
	else if(active->activeType == Going){  
		printf("Transfer from ");  
		printRoom(active->PlaceStart);  
		printf(" to ");  
		printRoom(active->PlaceEnd);  
		printf("\n");  
	}  
	else if (active->activeType == Staying){  
		printf("Stay in ");  
		printRoom(active->PlaceEnd);  
		printf("\n");  
	}  
}  

void print(int code)  
{  
	Active *tmp;  
	tmp = &Actives[code];  

	printf("%c\n", 'A'+code);  
	while(tmp!= NULL) {  
		if (tmp->Next != NULL) {  
			if (tmp->activeType == Waiting && tmp->Next->activeType == Waiting)  
				&nbs;
			p; tmp->Next->TimeStart = tmp->TimeStart;  
			else  
				printnode(tmp);  
		} else  
			printnode(tmp);  
		tmp = tmp->Next;  
	}  
	printf("\n");  
}  

int Time2Int(char time[])  
{  
	int a, b, c;  
	sscanf(time, "%d:%d:%d", &a, &b, &c);  
	return (a*60+b)*60+c;  
}  

int InitList(char code)  
{  
	int a, b;  
	char s[100];  
	scanf("%s", s);  
	if(code < 'A' || code > 'Z')  
		exit(0);  
	enterTime[code-'A'] = Time2Int(s);  
	while(1){  
		scanf("%d", &a);  
		if(a == 0)  
			return 0;  
		scanf("%d", &b);  
		toView[code-'A'][a/100][a%100] = b;  
	}  
	return 0;  
}  

int GetNextActive(int code, int *timeEnd, ActiveType *active, int *PlaceStart, int *PlaceEnd)  
{  
	int i, j, k, tt;  
	tt=Status[code]->activeType;  
	k = Status[code]->PlaceEnd;  
	if(k / 100 > 10 || k / 100 < 0 || k % 100 > 13 || k % 100 < 0)  
		exit(0);  
	if(code > 26 || code < 0)  
		exit(0);  
	roomFree[k/100][11] = (max(roomFree[k/100][11], now)-1)/5*5+5;  
	if (tt == Staying) {//刚刚从某个房间或者电梯出来  
		i = k / 100;  
		j = k % 100;  
		if (i == 0)  
			i ++;  
		if(k == 112){//准备出楼  
			*timeEnd = now+30;  
			*active = Going;  
			*PlaceStart = k;  
			*PlaceEnd = 113;  
			return 0;  
		}  
		for (; j <= 10; j++)  
			if (toView[code][i][j] > 0) {//本层还有房间要参观,走到那个房间  
				if(k != 100)  
					*timeEnd = now+10;  
				else  
					*timeEnd = now+30;  
				*active = Going;  
				*PlaceStart = k;  
				*PlaceEnd = i*100+j;  
				return 0;  
			}  
		for(i=i+1; i<=10; i++)  
			for(j=1; j<=10; j++)  
				if(toView[code][i][j] > 0){//上层有房间要参观，走到电梯  
					if (k != 100)  
						*timeEnd = now+10;  
					else  
						*timeEnd = now+30;  
					*active = Going;  
					*PlaceStart = k;  
					if (k != 0)  
						*PlaceEnd = k/100*100+11;  
					else  
						*PlaceEnd = 100+11;  
					return 0;  
				}  
		//无房间参观，出楼  
		if (k / 100 == 1) {//在一楼  
			*timeEnd = now + 30;  
			*active = Going;  
			*PlaceStart = k;  
			*PlaceEnd = 113;  
			return 0;  
		} else {//去电梯下1楼  
			*timeEnd = now+10;  
			*active = Going;  
			*PlaceStart = k;  
			*PlaceEnd = k/100*100+11;  
			return 0;  
		}  
	}  
	else if (tt == Waiting || tt == Going){//正在某个房间或者电梯等待以及走向某个房间或者电梯  
		if (k == 113) {//已经出楼  
			*timeEnd = 100000000;  
			*active = Staying;  
			&
				nbsp; *PlaceStart = *PlaceEnd = 113;  
			return 0;  

		}  
		if(roomFree[k/100][k%100] > now){//继续等待  
			*active = Waiting;  
			*timeEnd = roomFree[k/100][k%100];  
			*PlaceStart = *PlaceEnd = k;  
			return 0;  
		}  
		else {  
			*active = Staying;  
			if (k % 100 == 11) {//进电梯  
				roomFree[k / 100][k % 100] = now + 5;  
				for (i = k / 100 + 1; i <= 10; i++){  
					for (j = 1; j <= 10; j++)  
						if (toView[code][i][j] > 0) {//上楼  
							*timeEnd = now + (i - k / 100)*30;  
							*active = Staying;  
							*PlaceStart = k;  
							*PlaceEnd = i * 100;  
							roomFree[k/100][k%100] = now+5;  
							return 0;  
						}  
				}  
				*timeEnd = now + (k / 100 - 1)*30;  
				*active = Staying;  
				*PlaceStart = k;  
				*PlaceEnd = 112;  
				roomFree[k/100][k%100] = now+5;  
				return 0;  
			} else {//进房间  
				*timeEnd = now + toView[code][k / 100][k % 100];  
				*active = Staying;  
				*PlaceStart = *PlaceEnd = k;  
				toView[code][k / 100][k % 100] = 0;  
				roomFree[k / 100][k%100] = *timeEnd;  
				return 0;  
			}  
		}  
	}  
	return 0;  
}  

int main()  
{  
	bbbbb=0;  
	char s[100];  
	int i, k;  
	memset(toView, 0, sizeof(toView));  
	memset(enterTime, 0, sizeof(enterTime));  
	memset(Actives, 0, sizeof(Actives));  
	memset(roomFree, 0, sizeof(roomFree));  
	while(1){  
		scanf("%s", s);  
		if(s[0] == '.')  
			break;  
		InitList(s[0]);  
	}  
	for(i=0; i<30; i++)  
		if(enterTime[i] > 0){  
			Actives[i].PlaceStart = Actives[i].PlaceEnd= 100;  
			Actives[i].Next = NULL;  
			Actives[i].TimeStart = Actives[i].TimeOver = enterTime[i];  
			Actives[i].activeType = Staying;  
			Status[i] = &Actives[i];  
		}  
		else{  
			Actives[i].TimeOver = 100000000;  
			Actives[i].Next = NULL;  
			Status[i] = &Actives[i];  
		}  
	Status[29]->TimeOver = 100000000;  
	while(1){  
		k = 29;  
		for(i=0; i<26; i++)  
			if(Status[i]->TimeOver < Status[k]->TimeOver)  
				k = i;  
		if (Status[k]->TimeOver == 100000000)  
			break;  
		now = Status[k]->TimeOver;  
		//Active *tmp = &aaaaa[bbbbb++];  
		Active *tmp = new Active;  
		if(bbbbb >= 200000)  
			exit(0);  
		tmp->TimeStart = Status[k]->TimeOver;  
		GetNextActive(k, &tmp->TimeOver, &tmp->activeType, &tmp->PlaceStart, &tmp->PlaceEnd);  
		tmp->Next == NULL;  
		Status[k]->Next = tmp;  
		Status[k] = tmp;  
	}  
	for(i=0; i<26; i++)  
		&nbs;
	p; if(enterTime[i]> 0)  
		print(i);  
	return 0;  
}