/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
/**
*
* @author cteam051
*/
public class Ants {
/**
* @param args the command line arguments
*/
// public static BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
// public static StringTokenizer st = null;
public static int[] pole;
public static int[] mravenci;
// static String nextToken() {
// while (!st.hasMoreTokens()) {
// try {
// st = new StringTokenizer(input.readLine());
// } catch (IOException ex) {
// }
// }
// return st.nextToken();
// }
//
// static int nextInt() {
// return Integer.parseInt(nextToken());
// }
//
// static char nextChar() {
// return nextToken().charAt(0);
// }
public static void main
(String[] args
) { int delka, n;
int temp;
char smer;
int max;
int leva, prava;
pole = new int[100005];
mravenci = new int[100005];
Scanner sc
= new Scanner
(System.
in); while (sc.hasNext()) {
delka = sc.nextInt();
n = sc.nextInt();
max = -1;
leva = -1;
prava = -1;
for (int i = 0; i <= delka; i++) {
pole[i] = 0;
}
for (int i = 0; i < n; i++) {
temp = sc.nextInt();
smer = sc.nextLine().charAt(1);
if (smer == 'L') {
pole[temp] = 2;
if (max < temp) {
max=temp;
leva = -1;
prava = temp;
} else if (max == temp) {
prava = temp;
}
} else {
pole[temp] = 1;
if (max < (delka - temp)) {
max=delka - temp;
prava = -1;
leva = temp;
} else if (max == (delka - temp)) {
leva = temp;
}
}
}
int j = 0;
for (int i = 0; i <= delka; i++) {
if (pole[i] != 0) {
mravenci[j++] = i;
}
}
if (leva >= 0) {
for (int i = 0; i < j; i++) {
if (mravenci[i] == leva) {
leva = i;
break;
}
}
temp = leva + 1;
for (int i = temp; i < j; i++) {
if (pole[mravenci[i]] == 2) {
leva++;
}
}
}
if (prava >= 0) {
for (int i = j - 1; i >= 0; i--) {
if (mravenci[i] == prava) {
prava = i;
break;
}
}
temp = prava - 1;
for (int i = temp; i >= 0; i--) {
if (pole[mravenci[i]] == 1) {
prava--;
}
}
}
System.
out.
print("The last ant will fall down in "+max
+" seconds - started at "); if(prava > -1 && leva > -1){
System.
out.
println(+Math.
min(prava, leva
)+" and "+Math.
max(prava, leva
)+"."); }
else if (prava > -1) {
System.
out.
println(+pole
[mravenci
[prava
]]+"."); }
else{
System.
out.
println(+pole
[mravenci
[leva
]]+"."); }
}
}
}