#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
inline int bit(int x){return 1<<x;}
const int N=100010;
const int inf=0x3f3f3f3f;
int f[46][N],g[46][N];
int ban[N][35];
struct Graph{
	int head[N],ent;
	struct Edge{
		int nxt,c,j;
	}e[N*6];
	inline void adde(int x,int c,int j){
		e[++ent]={head[x],c,j};head[x]=ent;
	}
	void clear(int n){
		ent=0;for(int i=0;i<=n;i++)head[i]=0;
	}
}ef,eg;
int dig[10];
int mn[7][161052],mx[7][161052];
int pc[35];
int cost(int x,int y){
	int s=0;
	while(x||y){
		s+=(x%10)!=(y%10);
		x/=10;y/=10;
	}
	return s;
}
void init(int n){
	for(int i=0;i<=32;i++)pc[i]=__builtin_popcount(i);
	for(int i=0;i<=n;i++){
		int x=i;
		for(int j=1;j<=5;j++)dig[j]=x%10,x/=10;
		for(int S=0;S<bit(5);S++){
			x=0;
			for(int j=5;j>=1;j--){
				if(bit(j-1)&S)x=x*11+10;
				else x=x*11+dig[j];
			}
			ban[i][S]=x;
		}
	}
	for(int i=0;i<=n;i++)
		f[0][i]=g[0][i]=i;
	for(int k=1;k<=43;k++){
		for(int i=1;i<=6;i++)
			for(int j=0;j<=ban[n][31];j++)
				mn[i][j]=n+1,mx[i][j]=-1;
		ef.clear(n);eg.clear(n);
		for(int c=max(0,k-6);c<k;c++){
			for(int j=0;j<n;j++){
				eg.adde(g[c][j+1],c,j);
			}
			for(int j=1;j<=n;j++){
				ef.adde(f[c][j-1],c,j);
			}
		}
		for(int i=n-1;i>=0;i--){
			f[k][i]=f[k-1][i];
			for(int o=eg.head[i];o;o=eg.e[o].nxt){
				int c=eg.e[o].c,j=eg.e[o].j;
				for(int S=0;S<bit(5);S++){
					int x=ban[j][S];
					cmin(mn[k-c][x],j);
				}
			}
			for(int S=0;S<bit(5);S++){
				int x=ban[i+1][S];
				int c=k-pc[S]-1;
				if(c<0)continue;
				int p=mn[k-c][x];
				if(p==n+1)continue;
				if(p==0)cmin(f[k][i],p);
				else cmin(f[k][i],f[c][p-1]);
			}
		}
		for(int i=1;i<=n;i++){
			g[k][i]=g[k-1][i];
			for(int o=ef.head[i];o;o=ef.e[o].nxt){
				int c=ef.e[o].c,j=ef.e[o].j;
				for(int S=0;S<bit(5);S++){
					int x=ban[j][S];
					cmax(mx[k-c][x],j);
				}
			}
			for(int S=0;S<bit(5);S++){
				int x=ban[i-1][S];
				int c=k-pc[S]-1;
				if(c<0)continue;
				int p=mx[k-c][x];
				if(p==-1)continue;
				if(p==n)cmax(g[k][i],n);
				else cmax(g[k][i],g[c][p+1]);
			}
		}
	}
}
int calcf(int l,int r){
	if(l>=r)return 0;
	for(int k=0;k<=45;k++)
		if(f[k][r]<=l)
			return k;
	return N;
}
int calcg(int l,int r){
	if(l>=r)return 0;
	for(int k=0;k<=45;k++)
		if(g[k][l]>=r)
			return k;
	return N;
}
signed main(){
	init(99999);
	int T;read(T);
	while(T--){
		int l,r;read(l,r);
		int ans=inf;
		if(l==r)ans=0;
		for(int k=l;k<=r;k++){
			cmin(ans,max(calcf(l,k-1),calcg(k+1,r)) + 1 + cost(0,k));			
		}
		cout<<ans<<'\n';
	}
	return 0;
}