import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package googleCodeJam;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;

public class RecycledNumbersBig {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		int i;
		
		//System.out.println("size of map: " + map.size());
		try{
			
			FileInputStream fstream = new FileInputStream("/Users/mkay/Documents/input_31.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			int input1, input2;
			String str1, str2;
			int count = 0,j,m,n,num;
			  while ((strLine = br.readLine()) != null)
			  {
				  //System.out.println (strLine);
				  
				  if(count != 0 )
				  {
					  map = new HashMap<Integer, Integer>();
					  input1 = Integer.parseInt(strLine.split(" ")[0]);
					  input2 = Integer.parseInt(strLine.split(" ")[1]);
					  num=0;
					  
					  for(i=input1;i<input2;i++)
					  {
						 if(i<=99){
							 j=i/10+(i%10)*10;
							 
							 if(j!=i && j>= input1 && j<= input2 && j <= 99 && j > i){
								 num++;
							 }
						 }else if(i<= 999){
							 j=i;
							 for(int k=0;k<2;k++){
								 j=j/10+(j%10)*100;
								 if(j>= input1 && j<= input2 && j!=i && j >= 100 && j>i)
									 num++;
							 }
						 }
						 else if(i<= 9999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<3;k++){
								 j=j/10+(j%10)*1000;
								 if(j>= input1 && j<= input2 && j!=i && j>i){
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
									 //System.out.println(i + " : " + j);
									 
								 }
							 }
						 }
						 else if(i<= 99999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<4;k++){
								 j=j/10+(j%10)*10000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<5;k++){
								 j=j/10+(j%10)*100000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<6;k++){
								 j=j/10+(j%10)*1000000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 9999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<7;k++){
								 j=j/10+(j%10)*10000000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
					  }
					  //1761080
					  //999999
					  //for(Integer k: map.keySet())
						//  System.out.println(k + " : " + map.get(k));
					  //System.out.println("Case #"+ count + ": " + map.size() + " input: " + input1 + " : " + input2 + " num " + num);
					  System.out.println("Case #"+ count + ": " + num);
				  }
				  count++;
				  
			  }			  
			  in.close();
			}catch (IOException e)
		    {
				System.err.println("Error: " + e.getMessage());
		    }		
	}

}