import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.*;
import java.util.*;
import java.awt.*;
import static java.lang.System.*;

public class C {
	public static void main (String [] args) throws IOException {new C().run();}
	public void run() throws IOException{
		Scanner file = new Scanner(new File("C-large.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C.out")));
		
		int times = file.nextInt();
		for(int asdf = 0; asdf<times; asdf++){
			//System.out.println (asdf);
			int a = file.nextInt(), b = file.nextInt();
			HashSet<Point> set = new HashSet<Point>();
			for(int i = a; i<=b; i++){
				String s = ""+i;
				for(int j = 1; j<s.length(); j++){
					if( s.charAt(j) >= s.charAt(0) ){
						int x = Integer.parseInt(s.substring(j,s.length()) +s.substring(0,j));
						if( i<x && x<=b ){set.add(new Point(i,x));
						//System.out.println (i +" " + x);
						}
					}
				}
			}
			out.println("Case #"+(asdf+1)+": "+set.size());
		}
		out.close();
		System.exit(0);
	}
}