package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;

public class RecycledNumbers {

    public static void main(String[] args) {
        BufferedReader reader = null;
        PrintWriter writer = null;

        try {
            reader = new BufferedReader(new FileReader(new File("src/C-small-attempt0.in")));
            writer = new PrintWriter(new BufferedWriter(new FileWriter(new File("src/C-small-attempt0.out"))));

            String line = reader.readLine();
            boolean seenFirstLine = false;
            int caseId = 0;
            while(line != null) {
                if(!seenFirstLine) {
                    seenFirstLine = true;
                }
                else {
                    String[] tokens = line.split(" ");
                    final int A = Integer.parseInt(tokens[0]);
                    final int B = Integer.parseInt(tokens[1]);
                    int numPairs = findNumPairs(A, B);
                    writer.println("Case #" + caseId + ": " + numPairs);
                }
                line = reader.readLine();
                caseId++;
            }
        }
        catch(FileNotFoundException e) {
            e.printStackTrace();
        }
        catch(IOException e) {
            e.printStackTrace();
        }
        finally {
            try {
                reader.close();
                writer.close();
            }
            catch(IOException e) {
                e.printStackTrace();
            }
        }
    }

    static int findNumPairs(final int A, final int B) {
        int numRecycledPairs = 0;
        for (int n=A; n<=B; n++) {
            for (int m = n+1; m<=B; m++) {
                if (isRecycled(n, m)) numRecycledPairs +=1;
            }
        }
        return numRecycledPairs;
    }

    static boolean isRecycled(int n, int m) {
        if(n >= m) {
            throw new IllegalArgumentException("n >= m");
        }
        String nStr = Integer.toString(n);
        String mStr = Integer.toString(m);
        return (mStr + mStr).contains(nStr);
    }
}
