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

#define int long long
#define endl "\n"

const int N = 1e5 + 10, inf = 1e18;

vector<int> a(9), b(9);
int ans = inf;
void dfs(int cur, int sum, int res) {
	
	if (cur == 5) {
		ans = min(ans, res);
		return;
	}
	int st = a[cur], ed = (a[cur] + sum + 10 ) % 10, cnt;
	if (sum >= 0) {
		cnt = (b[cur] - st + 10) % 10;
	} else {
		cnt = (st - b[cur] + 10) % 10;
	}
	if (cnt <= abs(sum)) {
		dfs(cur + 1, sum > 0 ? cnt : -cnt, res);
		dfs(cur + 1, 0, res);
	} else {
		int dis1 = (b[cur] - ed + 10) % 10, dis2 = (ed - b[cur] + 10) % 10;
		dfs(cur + 1, sum + dis1, res + dis1);
		dfs(cur + 1, sum - dis2, res + dis2); //继承上轮

		dis1 = (b[cur] - st + 10) % 10, dis2 = (st - b[cur] + 10) % 10;
		dfs(cur + 1, dis1, res + dis1);
		dfs(cur + 1, -dis2, res + dis2); //不继承
	}

}
void solve() {
	string s1, s2;
	cin >> s1 >> s2;
	for (int i = 1; i <= 4; i++) {
		a[i] = a[i + 4] = s1[i - 1] - '0';
		b[i] = b[i + 4] = s2[i - 1] - '0';
	}
	ans = inf;
	dfs(1, 0, 0);
	cout << ans << endl;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int q = 1;
	cin >> q;
	while (q--) {
		solve();
	}
}