#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long 
const int mod=1e9+7;
const int N=2e5+5;

void solve(){
    string sa,sb;
    cin>>sa>>sb;
    vector<int> a(5),b(5);
    for(int i=0;i<4;i++){
        a[i]=sa[i]-'0';
    }
    for(int i=0;i<4;i++){
        b[i]=sb[i]-'0';
    }
    int ans=2e9;
    vector<pair<int,int>> ran={{0,3},{1,3},{0,2},{0,1},{2,3},{1,2},{2,2},{0,0},{3,3},{1,1}};
    for(int i=0;i<16;i++){
        vector<int> mg(5);
        for(int j=0;j<4;j++){
            if((i>>j)&1){
                mg[j]=(b[j]-a[j]+10)%10;
            }else{
                mg[j]=(a[j]-b[j]+10)%10;
            }
        }
        int cnt=0;
        for(auto now:ran){
            int minn=1e9;
            int c1=0;
            for(int j=now.first;j<=now.second;j++){
                minn=min(minn,mg[j]);
                c1+=((i>>j)&1);
            }
            if(c1==0||c1==now.second-now.first+1){
                for(int j=now.first;j<=now.second;j++){
                    mg[j]-=minn;
                }
                cnt+=minn;
            }
        }
        ans=min(ans,cnt);
    }
    cout<<ans<<endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int T=1;
    cin>>T;
    while(T--) solve();
    return 0;
}