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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

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

public class Init {

	/**
	 * @param args
	 */
	public static void main(String[] args) {	
		try {
		// ----------------------------------------------------- //
		
			BufferedReader br = new BufferedReader(new FileReader("C:\\input.in"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("C:\\output.out"));
			
			int testcases = Integer.parseInt(br.readLine());
			
			// For each test case
			for(int i = 0; i < testcases; i++){
				StringTokenizer st = new StringTokenizer(br.readLine()," ");
				int low = Integer.parseInt(st.nextToken());
				int high = Integer.parseInt(st.nextToken());
				int recycled = 0;
				
				// Loop through all numbers in the range
				for (int j = low; j <= high; j++) {
					String currentval = Integer.toString(j);
					
					// Test each arrangement of the current number to see if its a recycled pair
					for (int k = 1; k < currentval.length(); k++) {
						String newvalue = currentval.substring(k) + currentval.substring(0,k);
						if(newvalue.charAt(0) == '0') continue; // Check for leading 0
						int newval = Integer.parseInt(newvalue);
						if(j < newval && newval <= high){
							System.out.print(j);
							System.out.print(" ");
							System.out.println(newval);
							recycled++;
						}
					}
				}
				
				bw.write("Case #"+Integer.toString(i+1)+": "+Integer.toString(recycled));
				bw.newLine();
			}
			
			bw.flush();
			bw.close();
		// ----------------------------------------------------- //
		}
	
		catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		catch (IOException e) {
			e.printStackTrace();
		}
	}
}
