import java.util.Scanner;
public class Main {

    static int generuj(int xi) {
        return ((xi * 25173) + 13849) % 65536;
    }

    public static void main(String[] args) {
        Scanner input = new Scanner( System.in );
        int N = input.nextInt();
        int M = (int)Math.pow(2,N);
        int MM = M;
        int s0 = input.nextInt();
        int[][] pole = new int[N+1][];
        int[][] pole_hraci = new int[N+1][];
        pole[0] = new int [M];
        pole_hraci[0] = new int [M];
        for (int i = 0; i < M; i++){
            int s = generuj(s0);
            s0 = s;
            pole[0][i] = s;
            pole_hraci[0][i] = i;
        }
        for (int j = 1; j <= N; j++) {
            M = M / 2;
            pole[j] = new int[M];
            pole_hraci[j] = new int[M];
            for (int k = 0, k2 = 0; k < M; k++, k2 = k2+2){
                if (pole[j-1][k2] >= pole[j-1][k2+1]) {
                    pole[j][k] = pole[j-1][k2];
                    pole_hraci[j][k] = pole_hraci[j-1][k2];
                }
                else {
                    pole[j][k] = pole[j-1][k2+1];
                    pole_hraci[j][k] = pole_hraci[j-1][k2+1];
                }
            }
        }
        System.out.println((pole_hraci[N][0]+1)+" "+pole[N][0]);

        int pocet_zmien = input.nextInt();

        for (int i = 0; i < pocet_zmien; i++){
            int zmena_kto = input.nextInt();
            int zmena_skill = input.nextInt();
            pole[0][zmena_kto-1] = pole[0][zmena_kto-1] + zmena_skill;
            M = MM;
            int pocet_vyhier = 0;
            for (int j = 1; j <= N; j++) {
                int pom = pocet_vyhier;
                int k = zmena_kto-1;
                M = M / 2;
                if ((k % 2 )== 1) {
                    if (pole[j-1][k] >= pole[j-1][k-1]){
                        pole[j][((k-1) / 2)] = pole[j-1][k];
                        pole_hraci[j][((k-1) / 2)] = pole_hraci[j-1][k];
                        pocet_vyhier++;
                        k = ((k-1) / 2);
                    }
                    else {
                        j = N+1;
                    }
                }
                else {
                    if (pole[j-1][k] >= pole[j-1][k+1]){
                        pole[j][(k / 2)] = pole[j-1][k];
                        pole_hraci[j][(k / 2)] = pole_hraci[j-1][k];
                        pocet_vyhier++;
                        k = ((k) / 2);
                    }
                    else {
                        j = N+1;
                    }
                }
                if (pom == pocet_vyhier) j = N+1;
            }
            System.out.println(pocet_vyhier);
        }
    }
}