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.File;
import java.io.FileNotFoundException;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Scanner;

public class A {
	public static void main(String[] args) {
		new A().run();
	}

	private void run() {		
		Scanner s;
		try {
			s = new Scanner(new File("A.in"));
			
			int t = s.nextInt();
			s.nextLine();
			for (int i = 0; i < t; i++) {
				HashMap<String, Boolean> map = new HashMap<String, Boolean>();
				int count = 0;
				int a = s.nextInt();
				int b = s.nextInt();
				for(int j=a;j<=b;j++){
					String str = ""+j;
					String tmp = str;
					for (int k = 0; k < str.length()-1; k++) {
						tmp = tmp.charAt(tmp.length()-1) + tmp.substring(0, tmp.length()-1);
						int m = Integer.parseInt(tmp);
						if(Integer.parseInt(tmp) > j && m <=b ){
							if(!map.containsKey(j+"_"+m)){
								map.put(j+"_"+m, true);
								count++;
							}
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+count);
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
