#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int T;
char A[6], B[6];
int a[6], b[6];
int aa[6], bb[6];
int ans;
void dfs(int u,int t)
{
	if (u == 4)
	{
		ans = min(ans, t);
		return;
	}
	if (a[u] == b[u])
	{
		dfs(u + 1, t);
		return;
	}
	for (int i = u; i < 4; i++)
	{
		int j = i - u + 1;
		int sub1, sub2;
		if (a[u] < b[u])
		{
			sub1 = b[u] - a[u];
			sub2 = 10 - (b[u] - a[u]);
		}
		else
		{
			sub1 = 10 - (a[u] - b[u]);
			sub2 = a[u] - b[u];
		}


		for (int k = u; k <= u + j - 1; k++)
		{
			a[k] = (a[k] + sub1) % 10;
		}
		dfs(u + 1, t + sub1);
		for (int k = u; k <= u + j - 1; k++)
		{
			a[k] = (a[k] - sub1 + 10) % 10;
		}



		for (int k = u; k <= u + j - 1; k++)
		{
			a[k] = (a[k] - sub2 + 10) % 10;
		}
		dfs(u + 1, t + sub2);
		for (int k = u; k <= u + j - 1; k++)
		{
			a[k] = (a[k] + sub2) % 10;
		}
	}
}
void solve()
{
	ans = 2e9;
	cin >> A >> B;
	for (int i = 0; i < 4; i++)
	{
		a[i] = A[i] - '0';
		b[i] = B[i] - '0';
	}
	dfs(0, 0);
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	cin >> T;
	while (T--)
	{
		solve();
	}
	return 0;
}