calendar

/*
 Author: 曹北健
 Result: AC Submission_id: 4264799
 Created at: Wed Mar 30 2022 22:52:12 GMT+0800 (China Standard Time)
 Problem_id: 5443   Time: 1 Memory: 1732
*/

#include <stdio.h>
int main(){
    int A[13] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };
    int n, yi, di, i;
    scanf("%d", &n);
    while(n--){
        scanf("%d%d", &yi, &di);
        if((yi % 400 == 0) || ((yi % 4 == 0) && (yi % 100 != 0))){
            A[2] = 29;
        }
        else{
            A[2] = 28;
        }
        for(i = 1; i <= 12; i++){
            if(di > A[i]){
                di -= A[i];
            }
            else{
                break;
            }
        }
        printf("%d %d\n", i, di);
    }
    return 0;
}