#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int ans;
int a[10];


void dfs(int pos,int val,int cnt)
{
    if(pos == 5){
        ans = min(ans,cnt);
        return;
    }
    int x = a[pos];
    if(x<0)x+=10;
    if(x == 0){
        dfs(pos+1,0,cnt);
    }
    else{
        //逆时针转
        int tmp_x = -x;
        if(val<=tmp_x){
            dfs(pos+1,tmp_x,cnt);
        }
        else{
            if(val<0){
                int tmp = val - tmp_x;
                dfs(pos+1,tmp_x,cnt+tmp);
            }
            else{
                int tmp = x;
                dfs(pos+1,tmp_x,cnt+tmp);
            }
        }
        //顺时针转
        tmp_x = 10 - x;
        if(val >= tmp_x){
            dfs(pos+1,tmp_x,cnt);
        }
        else{
            if(val>0){
                int tmp = tmp_x - val;
                dfs(pos+1,tmp_x,cnt+tmp);
            }
            else{
                int tmp = tmp_x;
                dfs(pos+1,tmp_x,cnt+tmp);
            }
        }
    }
}
void solve()
{
    string s1,s2;
    cin>>s1>>s2;
    for(int i=1;i<=4;i++){
        a[i] = s2[i-1] - s1[i-1];
    }
    ans = 100;
    dfs(1,0,0);
    cout<<ans<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t  = 1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}