#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename... Args>
void bubu(Args... args) { cout << ":: "; ((cout << args << " "), ...); cout << endl; }
void bubu(vector<int> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;

//=======================================================================
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;
vector<int> A[N];
int dis[N], vis[N];
//=======================================================================

void dfs() {
	rep(i, 0, 9999) {
		string s = to_string(i);
		while (s.size() != 4) s = '0' + s;

		rep(l, 0, 3) rep(r, l, 3) {
			string tem = s;
			rep(k, l, r) {
				if (tem[k] < '9') tem[k] += 1;
				else tem[k] = '0';
			}
			A[i].push_back(stoi(tem));

			tem = s;
			rep(k, l, r) {
				if (tem[k] > '0')tem[k] -= 1;
				else tem[k] = '9';
			}
			A[i].push_back(stoi(tem));
		}
	}
}

void bfs() {
	queue<int> F;
	F.push(0);
	dis[0] = 0;
	rep(i, 1, 9999) dis[i] = INF;
	while (!F.empty()) {
		auto x = F.front(); F.pop();
		if (vis[x]) continue;
		vis[x] = 1;
		for (auto y : A[x]) {
			if (dis[y] > dis[x] + 1) {
				dis[y] = dis[x] + 1;
				F.push(y);
			}
		}
	}
}
signed main() {
	kuaidu();

	dfs(), bfs();

	cin >> T;
	while (T--) {
		string a, b; cin >> a >> b;
		rep(i, 0, 3) {
			int x = b[i] - a[i];
			if (x >= 0) b[i] = x + '0';
			else {
				b[i] = 10 + x + '0';
				// b[i] += 10; b[i] -= a[i];
			}
			// cout << b[i] << " ";
		}
		// cout << stoi(b) << endl;
		cout << dis[stoi(b)] << endl;
	}
	return 0;
}