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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Recycled {

	
	public static boolean isRecycled(int a, int b) {
		String left = a+"";
		String right = b+"";
		if(left.length()!=right.length()) return false;
		int l = left.length();
		for(int i=0;i<l;i++) {
			boolean o = true;
			for(int j=0;j<l;j++) {
				if(left.charAt((i+j)%l) == right.charAt(j)) continue;
				else o=false;
			}
			if(o) return true;
		}
		return false;
	}
	
	public static int next(int in) {
		int p = (int) (Math.log(in)/Math.log(10));
		int last = in - Math.abs(in/10)*10;
		if(last==0) return 0;
		return (int) (last*Math.pow(10, p) + in/10);
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
//		System.out.println(isRecycled(12345, 234521));
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = Integer.parseInt(in.readLine());
		for (int i = 1; i <= cases; i++) {
			String[]e = in.readLine().trim().split(" ");
			int A = Integer.parseInt(e[0]);
			int B = Integer.parseInt(e[1]);
			
			int count = 0;
			
			for(int x=A;x<B;x++) for(int y=x+1;y<=B;y++) if(isRecycled(x, y)) count ++;
			
			System.out.println("Case #"+i+": "+count);
		}
	}
	
}
