import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

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

}