import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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

public class Displayer
{
    public static void main(String[] args) throws IOException
    {
        Scanner kb = new Scanner(new File("/Users/mbp13/Documents/Google Code Jam/GCJ_Q3/src/input"));
        PrintStream out = new PrintStream(new File("/Users/mbp13/Documents/Google Code Jam/GCJ_Q3/src/output_q3"));
        int testNum,A,B;
        String tmpStr,tmpStr2,cut1,cut2;
        int cnt,x;
        testNum = kb.nextInt();
        for(int i=0;i<testNum;i++)
        {
            A = kb.nextInt();
            B = kb.nextInt();
            cnt = 0;
            for(int j=A;j<=B;j++)
            {
                tmpStr = j+"";
                for(int k=1;k<tmpStr.length();k++)
                {
                    cut1 = tmpStr.substring(0,k);
                    cut2 = tmpStr.substring(k,tmpStr.length());
                    tmpStr2 = cut2 + cut1;
                    x = Integer.parseInt(tmpStr2);
                    if(x > j && x >= A && x <= B)
                    {
                        cnt++;
                        System.out.println(j + " " + tmpStr2);
                    }
                }
            }
            out.println("Case #"+(i+1)+": "+cnt);
        }
    }
}
