import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

public class ProblemC {
	public static void main(String argv[])
	{
//		IOSystem ioSystem = new IOSystem("problem/A-small-attempt2");
		IOSystem ioSystem = new IOSystem("problem/C-small-attempt0");
//		IOSystem ioSystem = new IOSystem("problem/test");

		ioSystem.nextLong();
		while(ioSystem.hasNext())
		{
			int A = ioSystem.nextInt();
			int B = ioSystem.nextInt();

			int ret = 0;
			Set<String> set = new HashSet<String>();

			//smallã ãã§ãã¨ãã
			for(int i = A;i<B;i++)
			{
				if(i<10)continue;

				String s = ""+i;
				StringBuffer sb  = new StringBuffer(s);

				for(int j=0;j<sb.length()-1;j++)
				{
					char c = sb.charAt(0);
					sb.deleteCharAt(0);
					sb.append(c);

					if(sb.charAt(0)=='0')continue;

					int pair = Integer.parseInt(sb.toString());
					if(pair <= B && i < pair)
					{
//						System.out.println(s+":"+sb.toString());
						if(set.contains(i+sb.toString()))
						{
//							System.out.println("!!!"+i+":"+sb.toString());
						}
						else
						{
							ret++;
							set.add(i+sb.toString());
						}
					}

				}

			}


			ioSystem.appendAnswer(ret);
		}

		ioSystem.output();
	}
}


