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

import java.io.File;
import java.util.ArrayList;
import java.util.Formatter;
import java.util.List;
import java.util.Scanner;

public class recycled {
	
	static int A;
	static int B;
	static int count=0;
	static int n;
	
	private static Scanner x;
	private static Formatter y;
	static String newline = System.getProperty("line.separator");
	
	static List<String> words = new ArrayList<String>();	
	static int testCases;
	
	public static void main(String args[]){
		
		// open input file
		
		 try{
			  x= new Scanner(new File("C-large.in"));
			 				
				
		  }catch(Exception e){
			  System.out.println("Could not find the file");
		  }		  

		
		
		while(x.hasNext()){
			words.add(x.nextLine());			
		}
		testCases=Integer.parseInt(words.get(0));
		words.remove(0);
		
		
		int cnt=0;
		
		// create output file
		
		try{
			y= new Formatter("recycled.ou");
			//System.out.println("sampleTongue.ou has been created");
		
		}catch(Exception e){
			System.out.println("Could not create a file");
		}
		
		//evaluate		
		
		for(int k=0; k<testCases;k++){
			
			String[] pStr = (words.get(k)).split(" ");
			
			A=Integer.parseInt(pStr[0]);
			B=Integer.parseInt(pStr[1]);
			
			System.out.println("A :"+ A);
			System.out.println("B :"+ B);
			
				for(int i=A; i<=B; i++){
					
					n=i;
					String sNum=Integer.toString(i);
					cnt=shift(sNum.toCharArray());
					
					//System.out.println("////////////////////");
				}
			System.out.println("count :"+ cnt);
			
			y.format("Case #%d: ",(k+1));
			y.format("%d",cnt);
			y.format(newline);
			
			cnt=0;
			count=0;
		}
		
		
		x.close();
		y.close();
			
	}
	
	public static int shift(char[] c){
		
		
		char []d= new char[c.length];
		
		//shifting 
		for(int k=0; k<c.length; k++){
			
			for(int i=0; i<c.length ;i++){
				
				if(i==0)
					d[i]=c[c.length-1];
				else
					d[i]=c[i-1];
				
				//System.out.print(d[i]);
				
				
			}
			
			int m = Integer.parseInt(new String(c));
			
			
			if(A<=n && m>n && m<=B){
				count++;
				System.out.println(n+"  "+m);
			}
			//copying
			
			for(int j=0; j<c.length; j++){
				c[j]=d[j];
			}
			
		}
		
		return count;
	}
	
	
	
	
	
	
}
