#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
using namespace std;
string a,b;
unordered_map<string,int> mp;
void solve()
{
    queue<string> q;
    mp["0000"]=0;
    q.push("0000");
    while(q.size())
    {
        auto t=q.front();
        q.pop();
      	for(int k=1;k<=4;k++)
      	{
            for(int i=0;i<4-k+1;i++)
            {
                int j=i+k-1;
                string add=t,sub=t;
                for(int q=i;q<=j;q++)
                {
                    add[q]=((add[q]-'0'+1)%10)+'0';
                    sub[q]=((sub[q]-'0'+9)%10)+'0';
                }
                if(!mp[add])
                {
                	q.push(add);
                	mp[add]=mp[t]+1;
                }
                if(!mp[sub])
                {
                    q.push(sub);
                	mp[sub]=mp[t]+1;                	
                }
            }
      	}
    }
}
int main()
{
    int t;
    cin>>t;
    solve();
    while(t--)
    {
        cin>>a>>b;
        string c="0000";
       for(int i=0;i<4;i++)
       {
        c[i]=((a[i]-b[i]+10)%10)+'0';
       } 
    	cout<<mp[c]<<endl;
    }
    return 0;
}