左移右移/

import java.util.Arrays;
import java.util.Scanner;
// 1:无需package
// 2: 类名必须Main, 不可修改
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...
        int N = scan.nextInt();
        int M = scan.nextInt();
        num[]arr = new num[N+1];
        arr[0] = new num(0, 0);//不给0赋值sort会空指针
        for (int i = 1; i <= N ; i++) {
			arr[i] = new num(i, i);
		}
        int start = -1;
        int end = N+1;
        while (M-->0) {
			String a = scan.next();
			int b = scan.nextInt();
			if (a.equals("L")) {
				arr[b].geshu = start;
				start--;
			}else {
				arr[b].geshu = end;
				end++;
			}
		}
        Arrays.sort(arr);
        for (int i = 0; i <=N; i++) {
        	if (arr[i].geshu==0) {
				continue;
			}
			System.out.print(arr[i].shu+" ");
		}
        scan.close();
    }
}
class num implements Comparable<num>{
	int shu;
	int geshu;
	public num(int shu, int geshu) {
		this.shu = shu;
		this.geshu = geshu;
	}
	@Override
	public int compareTo(num o) {
		// TODO Auto-generated method stub
		if (this.geshu < o.geshu) {
			return -1;
		}else {
			return 1;
		}
	}
}