/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


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

public class PracticeC
{
	/* ±±©çÒW */
	private static final String fname = "C-small-attempt3.in"; // üÍpÌt@C¼
//	private static final int N = 10000;

	// private static void search(int v)
	// {
	// if (v < 21)
	// return;
	// String in = Integer.toString(v);
	// for (int i = 0; i < in.length(); i++)
	// {
	// String vs = "";
	// for (int j = 0; j < in.length(); j++)
	// {
	// char n = in.charAt((i + j + 1) % in.length());
	// if (vs.equals("") && n == '0')
	// break;
	// vs += n;
	// }
	// // System.out.println(v2);
	// if (vs.equals(""))
	// continue;
	// int v2 = Integer.valueOf(vs);
	// if (v > v2) val[v]++;
	// }
	// }

	private static void search(int v, int A, int B)
	{
		use = new boolean[B+1];
		String in = Integer.toString(v);
		for (int i = 0; i < in.length(); i++)
		{
			String vs = "";
			for (int j = 0; j < in.length(); j++)
			{
				char n = in.charAt((i + j + 1) % in.length());
				if (vs.equals("") && n == '0')
					break;
				vs += n;
			}
			// System.out.println(v2);
			if (vs.equals(""))
				continue;
			int v2 = Integer.valueOf(vs);
			if (v2 >= A && v > v2 && !use[v2])
			{
				use[v2] = true;
				val[v]++;
			}
		}
	}
	public static int val[];
	public static boolean use[];

	public static void solve()
	{
		int T = sc.nextInt();
		// for (int i = 21; i < val.length; i++) search(i);
		// for (int i = 0; i < 100; i++) if(val[i] != 0)
		// System.out.println(i+":"+val[i]);
		for (int i = 1; i <= T; i++)
		{
			int A = sc.nextInt();
			int B = sc.nextInt();
			val = new int[B+1];
			for (int j = A; j <= B; j++)
				search(j, A, B);
			int cnt = 0;
			for (int j = A; j <= B; j++)
			{
//				if(val[j] != 0) System.out.println(j+":"+val[j]);
				cnt += val[j];
			}
//			System.
			out.println("Case #" + i + ": " + (cnt));
		}
	}
	/* ±±ÜÅ */
	private static Scanner sc;
	private static PrintWriter out;
	public static void main(String args[])
	{
		try
		{
			sc = new Scanner(new File(fname));
//			sc = new Scanner(System.in);
			out = new PrintWriter(new BufferedWriter(new FileWriter(new File(fname + "_out.dat"))));
		} catch (Exception e)
		{
			e.printStackTrace();
		}
		solve();
		out.close();
	}

}
