#include<iostream>
#include<queue>
#include<stack>
using namespace std;
int main()
{
string s,s1;
int t,n,x;
cin>>t;
while(t--)
{
queue<int>a;
stack<int>b;
cin>>n>>s;
for(int i=0;i<n;i++)
if(s=="FIFO")
{
cin>>s1;
if(s1=="IN")
{
cin>>x;
a.push(x);
}
if(s1=="OUT")
{
if(a.empty()) cout<<"None"<<endl;
else
{
cout<<a.front()<<endl;
a.pop();
}
}
}
else
{
cin>>s1;
if(s1=="IN")
{
cin>>x;b.push(x);
}
if(s1=="OUT")
{
if(b.empty()) cout<<"None"<<endl;
else
{
cout<<b.top()<<endl;
b.pop();
}
}
}
}
return 0;
}