#include<iostream.h>
#include<string.h>
#include<stdlib.h>
int const StackMaxSize=100;
struct Stack
{
	char stack[StackMaxSize][80];
	int top;
};
void Push(Stack & S,const char item[],int n)
{
	if(S.top==StackMaxSize-1)
	{
		cerr<<"Stack overflow!"<<endl;
		exit(1);
	}
	S.top++;
	strcpy(S.stack[S.top],item);
}
char* Pop(Stack & S,char a[],int n)
{
	if(S.top==-1)
	{
		char *p="Ignored";
		return p;
	}
	else
	{
		a=S.stack[S.top];
		S.top--;
		return a;
	}
}
Stack Sb,Sf;

void main()
{
	Sb.top=Sf.top=-1;
	char *a=new char [80];
	strcpy(a,"http://www.acm.org/ ");
	char p[80]="";
	cin>>p;
	while(strcmp(p,"QUIT")!=0)
	{
		if(p[0]=='V')
		{
	        cin>>p;
			while(Sf.top!=-1)
				Sf.top--;
			
			Push(Sb,a,80);
		
			strcpy(a,p);
			for(int i=0;i<(int)strlen(a);i++)
				cout<<a[i];
			cout<<endl;
		}
		else if(p[0]=='B')
		{
	
			if(Sb.top==-1)
			
				cout<<"Ignored"<<endl;
			
			else
			{
				Push(Sf,a,80);
				a=Pop(Sb,a,80);
				for(int i=0;i<(int)strlen(a);i++)
					cout<<a[i];
				cout<<endl;
			}
		}
		else if(p[0]=='F')
		{
			if(Sf.top==-1)
				cout<<"Ignored"<<endl;
			else{
				Push(Sb,a,80);
				a=Pop(Sf,a,80);
				for(int i=0;i<(int)strlen(a);i++)
					cout<<a[i];
				cout<<endl;
			}
		}
		cin>>p;
	}
}