#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

const int N = 4;

    char a[N + 3], b[N + 3];
    int c[N + 3], t[N + 3];
    int ans;

void dfs(int step, int sum){
    if(step > N){
        ans = min(ans, sum);
        return ;
    }

    if(sum > ans)
        return ;
    
    //1: 0->c[i]
    t[step] = 1;
    if(t[step - 1] == 1)
        if(c[step] > c[step - 1])
            dfs(step + 1, sum + c[step] - c[step - 1]);
        else 
            dfs(step + 1, sum);
    else 
        dfs(step + 1, sum + c[step]);

    //2: n-c[i]<-0
    t[step] = 2;
    if(t[step - 1] == 2)
        if(c[step] < c[step - 1])
            dfs(step + 1, sum + c[step - 1] - c[step]);
        else 
            dfs(step + 1, sum);
    else 
        dfs(step + 1, sum + 10 - c[step]);

}

void sol(){
    scanf("%c%c%c%c %c%c%c%c\n", &a[1], &a[2], &a[3], &a[4], &b[1], &b[2], &b[3], &b[4]);
    for(int i = 1; i <= N; i++)
        c[i] = (b[i] - a[i] + 10) % 10;
    
    ans = 20;
    t[0] = -1;
    dfs(1, 0);
    printf("%d\n", ans);
    
}

int main(){
    int T;
    scanf("%d\n", &T);
    while(T--)
        sol();

    return 0;
}