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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
import java.util.HashSet;
import java.util.Scanner;
import java.util.Vector;


class Pair
{
	public int low;
	public int high;
	
	public Pair(int l, int h)
	{
		low = l;
		high = h;
	}
	
	public boolean equals(Object o)
	{
		Pair other = (Pair)o;
		
		return other.low == low && other.high == high;
	}
	
	public int hashCode()
	{
		return low * 31 + high; 
	}
}

public class C {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new C();
	}
	
	public C()
	{
		Vector<Pair> pairs = new Vector<Pair>();
		HashSet<Pair> set = new HashSet<Pair>();
		
		int[] powers = new int[8];
		
		int ac = 1;
		for(int i = 0; i < 8; ++i)
		{
			powers[i] = ac;
			ac *= 10;
		}
		
		for(int currentNumber = 10; currentNumber < 2000000; ++currentNumber)
		{
			String trick = "" + currentNumber;
			
			int length = trick.length();
			
			int[] digits = new int[trick.length()];
			int[] shuffle = new int[trick.length()];
			
			for(int c = 0; c < length; ++c)
			{
				int digit = trick.charAt(c) - '0';
				
				digits[c] = digit;
				shuffle[c] = digit;
			}
			
			for(int s = 1; s < length; ++s)
			{
				boolean atLeastOneLarger = false;
				
				
				for(int pos = 0; pos < length; ++pos)
				{
					int spos = (pos + s) % length;
					/* Check that position makes the shuffle larger. */
					if(shuffle[spos] < digits[pos])
					{
						break;
					}
					else if(shuffle[spos] > digits[pos])
					{
						atLeastOneLarger = true;
						break;
					}
				}
				
				if(atLeastOneLarger)
				{
					int secondNumber = 0;
					
					/* Generate the larger number. */
					for(int pos = 0; pos < length; ++pos)
					{
						int spos = (pos + s) % length;
						
						secondNumber += shuffle[spos] * powers[length - pos - 1];
					}
					
					if(secondNumber < 2000000 && secondNumber > currentNumber)
					{
						Pair newp = new Pair(currentNumber, secondNumber);
						
						if(!set.contains(newp))
						{
							pairs.add(newp);
							set.add(newp);
						}
						
					}
				}
			}
		}
		
		Scanner sc = new Scanner(System.in);
		
		int testCases = sc.nextInt();
		
		for(int testCase = 1; testCase <= testCases; ++testCase)
		{
			int A = sc.nextInt();
			int B = sc.nextInt();
			
			int lowIndex = binLow(A, pairs);
			int highIndex = binHigh(B, pairs);
			
			if(lowIndex == -1)
				lowIndex = 0;
			
			if(highIndex == -1)
				highIndex = 0;
			
			int ans = 0;
			for(int pair = lowIndex; pair <= highIndex; ++pair)
			{
				Pair p = pairs.elementAt(pair);
				
				if(p.low >= A && p.high <= B)
					ans++;
			}
			
			System.out.printf("Case #%d: %d\n", testCase, ans);
		}
		
		
	}

	private int binHigh(int b, Vector<Pair> pairs) {
		int low = 0;
        int high = pairs.size() - 1;
		
        int mid = (low + high)/2;
		
        while (true) {
        	int number = pairs.elementAt(mid).low;
            if (number == b || number < b) {
                low = mid+1;
                if (high < low)
                    return mid<pairs.size()-1?mid+1:-1;
            } else {
                high = mid-1;
                if (high < low)
                    return mid;
            }
            mid = (low + high)/2;
        }
	}

	private int binLow(int a, Vector<Pair> pairs) {
		int low = 0;
        int high = pairs.size() - 1;
		
        int mid = (low + high)/2;
        while (true) {
        	int number = pairs.elementAt(mid).low;
        	
            if (number == a || number > a) {
                high = mid-1;
                if (high < low)
                    return mid;
            } else {
                low = mid+1;
                if (high < low)
                    return mid<pairs.size()-1?mid+1:-1;
            }
            mid = (low + high)/2;
        }
	}
}
