#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

typedef long long LL;
#define int LL
#define inl inline
const int N = 3e5 + 10;
const int M = N * 2;
//const int mod=998244353;
const int mod = 1000000007;
const double eps = 1e-8;
//const int mod=1e9+7;
typedef pair<int,int> PII;
//const int INF=0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
int n, m;

void become_faster() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int h[N],e[M],ne[M],idx,w[M];
PII dist[10010];
int vis[10010];
map<PII,int>mm;
void add(int a,int b,int c) {
    //if(mm[{a,b}]||mm[{b,a}])return;
    //mm[{a,b}]=mm[{b,a}]=1;
    e[idx]=b;
    ne[idx]=h[a];
    w[idx]=c;
    h[a]=idx++;
}
void dijk(int s,int id,int t)
{
    //memset(dist, 0x3f, sizeof(dist));
    dist[s] = {id,0};
    priority_queue<PII, vector<PII>, greater<PII> >heap;
    heap.push({ 0,s });
    while (!heap.empty())
    {
        //cout<<"s"<<endl;
        PII tmp = heap.top();
        heap.pop();
        int ver = tmp.second, dis = tmp.first;
        if (vis[ver]==id)continue;
        vis[ver] = id;
        for (int i = h[ver]; i != -1; i = ne[i])
        {
            int j = e[i];
            if (dist[j].first!=id||dist[j].second > dis + w[i])
            {
                dist[j].second = dis + w[i];
                dist[j].first=id;
                if(j==t)return;
                heap.push({ dist[j].second,j });
            }
        }
    }
}

int to_dig(string s) {
    int res=0;
    for(auto c:s) {
        res=res*10+(c-'0');
    }
    return res;
}
void init() {
    memset(h,-1,sizeof(h));
    for(int i=0;i<=10000;i++)dist[i].second=INF;
    for(int i=0;i<=9999;i++) {
        string s=to_string(i);
        while(s.size()!=4)s="0"+s;


        for(int st=0;st<4;st++) {
            for (int ed = st; ed < 4; ed++) {
                string t = s;
                for (int k = st; k <= ed; k++) {
                    int x = s[k] - '0';
                    x++;
                    if (x >= 10)x = 0;
                    t[k] = x + '0';
                }

                int tmp=to_dig(t);
                //if(i==1234)cout<<"t="<<t<<endl;
                add(i,tmp,1);
                add(tmp,i,1);
            }
        }

        for(int st=0;st<4;st++) {
            for (int ed = st; ed < 4; ed++) {
                string t = s;
                for (int k = st; k <= ed; k++) {
                    int x = s[k] - '0';
                    x--;
                    if (x <0 )x = 9;
                    t[k] = x + '0';
                }

                int tmp=to_dig(t);
                //if(i==1234)cout<<"t="<<t<<endl;
                add(i,tmp,1);
                add(tmp,i,1);
            }
        }
    }
}
int Case;
void solve() {
    int a,b;
    cin>>a>>b;

    ++Case;
    dijk(a,Case,b);
    cout<<dist[b].second<<endl;
}

signed main() {
    become_faster();
    int T = 1;
    //T=read();
    init();
    cin>>T;
    //for(int i=1;i<=100;i++)solve(i);
    while (T--) solve();
    return 0;
}