// https://www.hackerrank.com/challenges/java-bitset/problem
import java.util.BitSet;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.function.BiConsumer;
public class JavaBitset {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int size = scanner.nextInt();
int queries = scanner.nextInt();
BitSet[] bitSets = new BitSet[]{new BitSet(size), new BitSet(size)};
Map> operations = new HashMap<>();
operations.put("AND", (index1, index2) -> bitSets[index1-1].and(bitSets[index2-1]));
operations.put("OR", (index1, index2) -> bitSets[index1-1].or(bitSets[index2-1]));
operations.put("XOR", (index1, index2) -> bitSets[index1-1].xor(bitSets[index2-1]));
operations.put("SET", (index1, index2) -> bitSets[index1-1].set(index2));
operations.put("FLIP", (index1, index2) -> bitSets[index1-1].flip(index2));
while (queries-- > 0){
operations
.get(scanner.next())
.accept(scanner.nextInt(), scanner.nextInt());
System.out.println(bitSets[0].cardinality() + " " + bitSets[1].cardinality());
}
}
}