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));
	}
}

//lukewillson
import java.io.PrintStream;
import java.io.File;
import java.util.Scanner;
public class C {    

    public static void main(String[] args) throws Exception {
        new DoC();
    }
}

class DoC {

    public DoC() throws Exception {
        //long time=System.currentTimeMillis();
        System.setOut(new PrintStream(new File("C.out")));
        Scanner sc = new Scanner(new File("C-small-attempt0.in"));
        int runs = Integer.parseInt(sc.nextLine());
        int run = 0;
        while (run++ < runs) {
            System.out.print("Case #" + run + ": ");
            int min=sc.nextInt();
            int max=sc.nextInt();
            int count=0;
            for(int i=min;i<=max;++i)
            {
                for(int j=i+1;j<=max;++j)
                {
                    if(recycle(i,j))
                        count++;
                }
            }
            System.out.println(count);
        }
        //System.out.println(System.currentTimeMillis()-time);
    }
    public boolean recycle(int A,int B)
    {
        String a=""+A;
        String b=""+B;
        for(int i=0;i<b.length();++i)
        {
            String temp=b.substring(i)+b.substring(0,i);
            if(a.equals(temp))
                return true;
        }
        return false;
    }
}
