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

using namespace std;

int main() {
	int n,m,b;
	int iTemp = 0;
	char a[15];
	int c[10];
	int k=0;
	scanf("%d%d",&n,&m);
	int l=0;
	for(int j=0; j<m; j++) {
		scanf("%s",a);
		if(strcmp(a,"pushLeft") == 0 && iTemp < n) {
			scanf("%d",&b);
			printf("Pushed in left: %d\n",b);
			if(k > 0) {
				for(int i=k; i>=0; i--) {
					c[i] = c[i-1];
				}
			}
			c[0] = b;
			k++;
			iTemp++;
			continue;
		}
		if(strcmp(a,"pushRight") == 0 && iTemp < n) {
			scanf("%d",&b);
			printf("Pushed in right: %d\n",b);
			c[k] = b;
			k++;
			iTemp++;
			continue;
		}
		if( (strcmp(a,"pushLeft") == 0|| strcmp(a,"pushRight") == 0) && iTemp == n) {
			scanf("%d",&b);
			printf("The queue is full\n");
			continue;
		}

		if(strcmp(a,"popLeft") == 0 && iTemp > 0) {
			printf("Popped from left: %d\n",c[0]);
			for(int i=1; i<k; i++) {
				c[i-1] = c[i];
			}
			iTemp--;
			k--;
			continue;
		}
		if(strcmp(a,"popRight") == 0 && iTemp > 0) {
			printf("Popped from right: %d\n",c[k-1]);
			iTemp--;
			k--;
			continue;
		}
		if( (strcmp(a,"popRight") == 0|| strcmp(a,"popLeft") == 0) && iTemp == 0) {
			printf("The queue is empty\n");
		}

	}
	return 0;
}