#include<bits/stdc++.h>

using i64 = long long;

void DAOQI() {
    std::string a, b;
    std::cin >> a >> b;
    std::vector<int> vis(10000, -1);
    vis[std::stoi(a)] = 0;
    std::queue<std::string> q;
    q.push(a);
    while (!q.empty()) {
        auto s = q.front();
        q.pop();
        auto t1 = std::stoi(s);
        if (s == b) {
            std::cout << vis[t1] << "\n";
            return;
        }
        for (int j = 0; j < 4; j++) {
            if (b[j] == s[j]) continue;
            for (int k = j; k <= 4; k++) {
                if (k == 4 || ((b[j] - s[j]) * (b[k] - s[k])) <= 0) {
                    auto ts = s, ts2 = s;
                    for (int i = j; i < k; i++) {
                        if (ts[i] == '0') ts[i] = '9';
                        else ts[i]--;
                        if (ts2[i] == '9') ts[i] = '0';
                        else ts2[i]++;
                    }
                    auto t2 = std::stoi(ts), t3 = std::stoi(ts2);
                    if (vis[t2] == -1 || vis[t2] > vis[t1] + 1) {
                        q.push(ts);
                        vis[t2] = vis[t1] + 1;
                    }
                    if (vis[t3] == -1 || vis[t3] > vis[t1] + 1) {
                        q.push(ts2);
                        vis[t3] = vis[t1] + 1;
                    }
                }
            }
        }
    }
    std::cout << vis[std::stoi(b)] << "\n";
}

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