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.*;
import java.util.HashSet;
import java.util.Set;

public class Recycled {
    public static void main(String []args)
    {
        int T,counter = 1;
       try {
         BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(new File("output.txt"))));
           String input = reader.readLine();
            T = Integer.parseInt(input);
            while (T-->0)
            {
                input= reader.readLine();
                String []in = input.split(" ");
                int A,B;
                A=Integer.parseInt(in[0]);
                B=Integer.parseInt(in[1]);
                int numPairs = 0;
                for(int i=A;i<=B;i++)
                {
                    Set<Integer> pairs = new HashSet<Integer>();
                    String num = String.valueOf(i);
                    int currentHighestFaceValue = num.charAt(0);
                    for(int j=num.length()-1;j>0;j--)
                    {
                       if(num.charAt(j)=='0')
                        {
                            continue;
                        }
                       if(num.charAt(j)<currentHighestFaceValue)
                        {

                        }
                        else
                        {
                            String poss = num.substring(j) + num.substring(0,j);
                            int possNum = Integer.parseInt(poss);
                            if(possNum<=B && i<possNum)
                            {
                                pairs.add(possNum);
                            }
                        }
                   }
                        numPairs+=pairs.size();
                    }

                writer.write("Case #"+counter+": "+numPairs+"\n");
                counter++;
            }
           writer.flush();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}
