...

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
#define ll long long
int T;
int m;
char s[30];
int date[7];
int a[10]={6, 1, 5, 5, 4, 5, 6, 3, 7, 6};
ll ans;
int fun(){
    date[2]+=1;
    int x=30;
    int t2=date[1];
    int t=date[0];
    if(t2==1||t2==3||t2==5||t2==7||t2==8||t2==10||t2==12) x=31;
    if(t2==2&&(t%4==0)&&(t%100!=0||t%400==0)){
        x=29;
    }
    else if( t2==2) x=28;
    if(date[2]>x) {
        date[2]=1;
        date[1]+=1;
    }
    if(date[1]>12) {
        date[1]=1;
        date[0]+=1;
    }
    int sum=0;
    int i=0;
    while(t){
        sum+=a[t%10];
        t/=10;
        i++;
    }
    sum+=(4-i)*6;
    i=0;
    while(t2){
        sum+=a[t2%10];
        t2/=10;
        i++;
    }
    sum+=(2-i)*6;
    i=0;
    int t3=date[2];
    while(t3){
        sum+=a[t3%10];
        t3/=10;
        i++;
    }
    sum+=(2-i)*6;
    return sum;
}
bool solve(){
    date[0]=(s[0]-'0')*1000+(s[1]-'0')*100+(s[2]-'0')*10+(s[3]-'0');
    date[1]=(s[4]-'0')*10+(s[5]-'0') ;
    date[2]=(s[6]-'0') *10+(s[7]-'0');
    if(m<8||m>48) return false;
    for(int i=0;;i++){
        int t=fun();
        if(date[0]>2999) return false;
        if(t==m) {
            ans=i;
            return true;
        }
    }
}
int main(){
    scanf("%d", &T);
    while(T--){
        scanf("%s", s);
        scanf("%d", &m);
        if(solve()){
            cout<<ans<<endl;
        }
        else cout<<"-1"<<endl;
    }
}