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();
	}
}



import java.io.*;
import java.util.*;


class ProblemC
{



  public static void main(String[] args) throws IOException
  {
	FileReader fr = new FileReader(args[0]);
	BufferedReader br = new BufferedReader(fr);
	String[] splittArray;
	int[] points;
	int A,B,res;
	int T = Integer.parseInt(br.readLine());
	//System.out.println(T);

	String dummy;
	String result="";
	for(int i=1;i<=T;i++) {
		dummy=br.readLine();
		splittArray=dummy.split(" ");
		A=Integer.parseInt(splittArray[0]);
		B=Integer.parseInt(splittArray[1]);
		res=0;
		for(int j=A;j<B;j++) {
			
			res+=permutes(j,new Integer(j).toString(),B);
		}
		
		result+="Case #"+i+": "+res;
		if(i<T) result+="\r\n";
	}
	br.close();





	FileWriter writer;
  	File file;
  
	     file = new File(args[1]);
     try {
      
       writer = new FileWriter(file ,true);
       
       // Text wird in den Stream geschrieben
      
       writer.write(result);
       
       
       // Schreibt den Stream in die Datei
       // Sollte immer am Ende ausgefÃ¼hrt werden, sodass der Stream 
       // leer ist und alles in der Datei steht.
       writer.flush();
       
       // SchlieÃt den Stream
       writer.close();
    } catch (IOException e) {
      e.printStackTrace();
    }
	
  }

public static int permutes(int b,String a,int c) {
	LinkedList<Integer> result=new LinkedList<Integer>();
	String dummy;
	int dummy2;

	for(int i=1;i<=a.length()-1;i++) {
		dummy=a.substring(i,a.length())+a.substring(0,i);
		dummy2=Integer.parseInt(dummy);
		if(dummy2>b && dummy2<=c && !result.contains(dummy2)) result.add(dummy2);
	}

	return result.size();
}
	

}

