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

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class Recycled {

	
	public static boolean isRecycled(int a, int b) {
		String left = a+"";
		String right = b+"";
		return (left+left).contains(right);
		//		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 Set<Integer> recycles(int in) {
		String s = in+"";
		int l = s.length();
		Set<Integer> out = new HashSet<Integer>();
		for(int i=1;i<l;i++) {
			String n = "";
			for(int j=0;j<l;j++) n += s.charAt((i+j)%l);
			out.add(Integer.parseInt(n));
		}
		return out;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		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:recycles(x)) {
					if(x<y && y<=B) count ++;
				}
			}
			
			System.out.println("Case #"+i+": "+count);
		}
	}
	
}
