import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


/**
 *
 * @author ZIYAN
 */
public class Test {

    /**
     * @param args the command line arguments
     */
       public static void main(String[] args) throws FileNotFoundException, IOException {
        
        
         Scanner scanner = new Scanner(new File("C:\\Documents and Settings\\ZIYAN\\Desktop\\C-small-attempt0.IN"));
       
       
        FileWriter fstream = new FileWriter("C:\\Documents and Settings\\ZIYAN\\Desktop\\out.txt");
        BufferedWriter out = new BufferedWriter(fstream);
        
        int cases=scanner.nextInt();
        for(int l=0;l<cases;l++)
        {
            out.write("Case #"+(l+1)+": ");
        int a,b;
        a=scanner.nextInt();
        b=scanner.nextInt();
        
        int[] x=new int[b-a+1];
        x[0]=a;
        for(int i=1;i<b-a+1;i++)
        {
           x[i]= x[i-1]+1;
        
            
        }
        int rslt=0;
        for(int m=0;m<x.length;m++)
        {
        String sr="";
        
        sr+=x[m];
        
        
        char[] c=new char[chkdgt(a)];
        c=sr.toCharArray();
        
        for(int p=0;p<c.length;p++)
        {
            
            String br=new String(c);
            int var=Integer.parseInt(br);
            for(int q=m+1;q<x.length;q++)
            {
                if(var==x[q] && x[q]!=0)
                {
                    System.out.println(x[q]);
                    
                    rslt++;
                }
            }
            c=rotate(c);
        }
        }
        System.out.println(rslt);
        String st="";
        st+=rslt;
        out.write(st);
        out.newLine();
        }
        out.close();
    }
    public static char[] rotate(char[] x)
    {
        char[] y=new char[x.length];
        for(int i=0;i<x.length;i++)
        {
            if(i==x.length-1)
            {  
                y[0]=x[i];
            
            }
            else{
            
                y[i+1]=x[i];
            }
            
        }
        String str="";
        String str2="";
        for(int i=0;i<x.length;i++)
        {
            str+=y[i];
            str2+=x[i];
        }
        return str.toCharArray();
        
    }
    public static int chkdgt(int x)
    {
        int dgt=10;
        int rs=1;
        while(x>=dgt)
        {
            dgt*=10;
            rs++;
        }
        return rs;
    }
}

