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.Scanner;
public class RecycledNumbers{
  
  public static void main(String[] args){
    
    //read filename from user
    Scanner request = new Scanner(System.in);
    System.out.println("Enter file name");
    String fileName = request.nextLine();
    
    
    try{
    //create a filereader to read through file contents
      
    Scanner inputFile = new Scanner(new File(fileName));
    //create output file
    BufferedWriter outputFile = new BufferedWriter(new FileWriter("output.txt"));
    
    //read file contents
    
    int lineCount = inputFile.nextInt();
    for(int i=0; i<lineCount;i++){
      int totalCount = 0;
      int a = inputFile.nextInt();
      int b = inputFile.nextInt();
      for(int x=a;x<=b;x++){
      totalCount += recycle(x,b);
      }
      //System.out.println("------------------>"+totalCount);
      outputFile.write("Case #"+ (i+1) + ": " +totalCount);
      outputFile.newLine();
      
    }
   outputFile.close();
    }
    catch(IOException e){
      System.out.println("Error getting file");
    }
  }//end of main
  
  public static int recycle(int base, int max){
    
    String num = base+"";
    int length = num.length();
    //System.out.println(num + " "+length);
    int loop = length-1;
    String front="";
    String back="";
    int result=0;
    int correct=0;
    int current=-99;
    
    for(int i=0; i<=loop; i++){
      
      front = num.substring(0,loop-i);
      back = num.substring(loop-i);
      String res=back+front;
      
      result = Integer.parseInt(res);
      //System.out.println(result);
      
      if((result!=current) && (result > base) && (result <=max)){
        
        current = result;
        correct++;
      }
    }
    return correct;
  }//end of recycle
  
}//end of class