#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++) {
            for (int k = j; k < 4; k++) {
                auto t = s;
                for (int o = j; o <= k; o++) {
                    if (t[o] < '9') t[o]++;
                    else t[o] = '0';
                }
                auto tt = std::stoi(t);
                if (vis[tt] == -1 || vis[tt] > vis[t1] + 1) {
                    vis[tt] = vis[t1] + 1;
                    q.push(t);
                }
                t = s;
                for (int o = j; o <= k; o++) {
                    if (t[o] > '0') t[o]--;
                    else t[o] = '9';
                }
                tt = std::stoi(t);
                if (vis[tt] == -1 || vis[tt] > vis[t1] + 1) {
                    vis[tt] = vis[t1] + 1;
                    q.push(t);
                }
            }
        }
    }
    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;
}