#include<algorithm>
#include<cmath>
#include<iostream>
#include<string>
#include<cstdio>

#define size stack_size

//#include"BetterMath.h"

using namespace std;

long long stack[1000005];
long long size;

void push(long long push) {
	for (long long i = size-1; i > -1; i++) {
		stack[i + 1] = stack[i];
	}
	stack[0] = push;
	size++;
}

void pop() {
	if (size == 0) {
		cout << "Empty"<<endl;
	}
	else {
		cout << stack[0];
		size--;
		for (long long i = 0; i < size - 1; i++) {
			stack[i] = stack[i + 1];
		}
	}
}

void query() {
	if (size == 0) {
		cout << "Anguei!" << endl;
	}
	else {
		cout << stack[0] << endl;
	}
}

void cout_size() {
	cout << size << endl;
}

void clean_stack() {
	size = 0;
}

int main() {
	long long t, n;
	cin >> t >> n;
	long long x;
	string inputstr;
	for (long long i = 0; i < t; i++) {
		for (long long j = 0; j < n; j++) {
			cin >> inputstr;
			switch (inputstr[0]) {
			case 'p':
				switch (inputstr[1]) {
				case 'u':cin >> x; push(x); break;
				case 'o':pop(); break;
				}
			case 'q':query(); break;
			case 's':cout_size(); break;
			}
		}
		clean_stack();
	}
	return 0;
}