#include <bits/stdc++.h>

#define int long long
#define endl '\n'

using namespace std;
const int N = 1e4 + 10,INF=1e9+10;

int a[N],b[N];
int dp[5][10][2];//µ±Ç°ÄÜÁ¬ÐøµÄºÍ²»ÄÜÁ¬ÐøµÄ 
int ans=INF;
int su(int au,int bu){return bu-au<0?bu-au+10:bu-au;}
int sd(int au,int bu){return au-bu<0?au-bu+10:au-bu;}

void solve() {
	ans=INF;
	string s,t;cin >> s >> t;
	s='.'+s;t='.'+t;
	for(int i=1;i<=4;i++){
		a[i]=s[i]-'0';
		b[i]=t[i]-'0';
	}
	memset(dp,0x3f,sizeof dp);
	dp[1][su(a[1],b[1])][0]=su(a[1],b[1]);//0±íʾÏòÉÏ
	dp[1][sd(a[1],b[1])][1]=sd(a[1],b[1]);
	for(int i=2;i<=4;i++){
		int p1=0x3f,p2=0x3f;
		for(int j=0;j<=9;j++){//ö¾ÙÉÏÒ»¸öÏòÉÏ»òÕß˵ÏòϵIJ½Êý
			int au=(a[i]+j)%10,ad=(a[i]-j+10)%10;
			p1=min(dp[i-1][j][0],p1),p2=min((dp[i-1][j][1]),p2);
			dp[i][su(a[i],b[i])][0]=min(dp[i][su(a[i],b[i])][0],dp[i-1][j][0]+(j>=su(a[i],b[i])?0:su(au,b[i])));
			dp[i][sd(a[i],b[i])][1]=min(dp[i][sd(a[i],b[i])][1],dp[i-1][j][1]+(j>=sd(a[i],b[i])?0:sd(ad,b[i])));
		}	
		dp[i][su(a[i],b[i])][0]=min(dp[i][su(a[i],b[i])][0],p2+su(a[i],b[i]));
		dp[i][sd(a[i],b[i])][1]=min(dp[i][sd(a[i],b[i])][1],p1+sd(a[i],b[i]));
	} 
	
	for(int j=0;j<=9;j++) ans=min(ans,min(dp[4][j][0],dp[4][j][1]));
	cout<<ans<<endl;
}
/*
6
1234 2345
1234 0123
1234 2267
1234 3401
1234 1344
1234 2468
*/
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T;cin >> T;
	while (T--) solve();
}