/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class RecycledNumbers {
	static class Pair {
		public int n;
		public int m;
		public Pair(int n, int m) {
			this.n = n;
			this.m = m;
		}
	}
	public static void main(String[] args) throws IOException {
		recycleNumbers(new BufferedReader(new FileReader("C-small-attempt2.in")), new BufferedWriter(new FileWriter("out.txt")));
	}
	
	public static void recycleNumbers(BufferedReader in, BufferedWriter out) throws IOException {
		String line = in.readLine(); // we don't care about num test cases
		int caseNum = 1;
		
		while ((line = in.readLine()) != null && line.length() != 0 ) {
			String result = "Case #" + caseNum + ": ";
			String[] lineDetails = line.split(" ");
			int n = Integer.parseInt(lineDetails[0]);
			int m = Integer.parseInt(lineDetails[1]);
			int recyclablePairs = 0;
			//boolean test = false;
			//if (n == 747 && m == 789) {
			//	test = true;
			//}
																// 12345, 34512
			
			String cheat = Integer.valueOf(n).toString();
			int zeroes = cheat.length()-1;
			int mask = (int) Math.pow(10, zeroes);
			//int mask = 1;
			//while (((mask*10) / n) <= 1) {
			//	mask *= 10;
			//}
			
			
			//int zeroes = (int) Math.log10(mask);
			

			//if (test) {
			//	System.out.println("mask is " + mask + ", zeroes is " + zeroes);
			//}
			
			for (int i = n; i < m; i++) {
				for (int j = i + 1; j <= m; j++) {
					int lhs = i;								// 
					int rhs = j;								// 2100
					for (int k = 0; k < zeroes; k++) {
						int head = lhs % 10;					// 5		4
						int tail = lhs / 10;					// 1234		5123
						lhs = (head * mask) + tail;				// 51234	45123	


						//if (test) {
						//	System.out.println("head is " + head + ", tail is " + tail + ", lhs is " + lhs);
						//}
						if (lhs == rhs) {


							//if (test) {
							//	System.out.println("i is " + i + ", j is " + j);
							//}
							recyclablePairs++;
							break;
						}
					}
				}
			}
			result += recyclablePairs;
			out.write(result);
			out.newLine();
			caseNum++;
		}
		in.close();
		out.close();
	}
}
