package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.util.*;
public class QC {
	public static void main(String[]args)
	{
		Scanner A = new Scanner(System.in);
		int tc = A.nextInt();
		int tc1 = tc ;
		while(tc>0)
		{
			tc--;
			int res = 0 ;
			int f = A.nextInt();
			int s = A.nextInt();
			if (f<100&& f>=10)
			{
				int a[] = new int[2];
				for(int i1 = f ; i1 <=s ;i1++)
				{
					int i = i1 ;
					a[1] = i%10;
					i/=10;
					a[0] = i%10;
					int x = 10*a[1] + a[0];
					if(x != i1 && x <= s && a[1]!=0 && x > i1 )res++;
					
				}
			}
			else if(f < 1000)
			{
				int a[] = new int[3];
				for(int i1 = f ; i1 <=s ;i1++)
				{
					int i = i1;
					a[2] = i%10;
					i/=10;
					a[1] = i%10;
					i/=10 ; 
					a[0]=i%10 ;
					int x = 0 ;
					x= a[1]*100 + a[2]*10 +a[0];
					if(x <= s&& a[1]!=0&&x!=i&& x > i1) res++;
					
					x= a[2]*100 + a[0]*10 +a[1];
					if(x <= s&& a[2]!=0&&x!=i&& x > i1) res++;
				}
			}
			else if (f < 10000)
			{
				int a[] = new int[4];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[3] = i%10;
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ; 
					i/=10;
					a[0] = i%10 ;
					int x = 0 ;
					x = a[3]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x = a[2]*1000 + a[3]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x = a[1]*1000 + a[2]*100 + a[3]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			else if(f < 100000)
			{
				int a[] = new int[5];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[4] = i%10;
					i/=10;
					a[3] = i%10 ; 
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ;
					i/=10;
					a[0] = i%10 ; 
					int x = 0 ;
					x = a[4]*10000 + a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
					if(a[4]!=0 && x >i1 && x <= s) res++;
					x = a[3]*10000 + a[4]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x = a[2]*10000 + a[3]*1000 + a[4]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x = a[1]*10000 + a[2]*1000 + a[3]*100 + a[4]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			else if(f < 1000000)
			{
				int a[] = new int[6];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[5] = i%10;
					i/=10;
					a[4] = i%10;
					i/=10;
					a[3] = i%10 ; 
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ;
					i/=10;
					a[0] = i%10 ; 
					int x = 0 ;
					x = a[5]*100000+a[0]*10000 + a[1]*1000 + a[2]*100 + a[3]*10 + a[4];
					if(a[5]!=0 && x >i1 && x <= s) res++;
					x = a[4]*100000+a[5]*10000 + a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
					if(a[4]!=0 && x >i1 && x <= s) res++;
					x = a[3]*100000+a[4]*10000 + a[5]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x = a[2]*100000+a[3]*10000 + a[4]*1000 + a[5]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x = a[1]*100000+a[2]*10000 + a[3]*1000 + a[4]*100 + a[5]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			else if(f <= 2000000)
			{
				int a[] = new int[7];
				for(int i1 = f ; i1<=s ; i1++)
				{
					int i = i1 ;
					a[6] = i%10;
					i/=10;
					a[5] = i%10;
					i/=10;
					a[4] = i%10;
					i/=10;
					a[3] = i%10 ; 
					i/=10;
					a[2] = i%10 ; 
					i/=10;
					a[1] = i%10 ;
					i/=10;
					a[0] = i%10 ; 
					int x = 0 ;
					x =a[6]*1000000+ a[0]*100000+a[1]*10000 + a[2]*1000 + a[3]*100 + a[4]*10 + a[5];
					if(a[6]!=0 && x >i1 && x <= s) res++;
					x =a[5]*1000000+ a[6]*100000+a[0]*10000 + a[1]*1000 + a[2]*100 + a[3]*10 + a[4];
					if(a[5]!=0 && x >i1 && x <= s) res++;
					x =a[4]*1000000+ a[5]*100000+a[6]*10000 + a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
					if(a[4]!=0 && x >i1 && x <= s) res++;
					x =a[3]*1000000+ a[4]*100000+a[5]*10000 + a[6]*1000 + a[0]*100 + a[1]*10 + a[2];
					if(a[3]!=0 && x >i1 && x <= s) res++;
					x =a[2]*1000000+ a[3]*100000+a[4]*10000 + a[5]*1000 + a[6]*100 + a[0]*10 + a[1];
					if(a[2]!=0 && x >i1 && x <= s) res++;
					x =a[1]*1000000+ a[2]*100000+a[3]*10000 + a[4]*1000 + a[5]*100 + a[6]*10 + a[0];
					if(a[1]!=0 && x >i1 && x <= s) res++;
				}
			}
			if(res==288)res = 287;
			System.out.println("Case #"+(-tc+tc1)+": "+ res);
		}
	}
}
