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.util.*;

public class QC {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int[][] ROT = new int[2000001][7];
		for(int i=1; i<=2000000; i++) {
			int A = i;
			int pow10 = 1;
			while(A > 0) { pow10*=10; A/=10; }
			pow10 /= 10;
			A = i;
			int ix = 0;
			do {
				if(A < i)
					ROT[i][ix++] = A;
				A = pow10*(A%10)+A/10;
			} while(A != i);
		}
		
		int T = in.nextInt();
		for(int cas=0; cas<T; cas++) {
			int A = in.nextInt();
			int B = in.nextInt();
			long ans = 0;
			Set<Integer> U = new HashSet<Integer>();
			for(int i=A; i<=B; i++) {
				long cnt = 0;
				for(int j=0; j<7; j++) {
					if(ROT[i][j]<i && ROT[i][j]>=A && ROT[i][j]<=B)
						cnt++;
				}
				ans += cnt;
			}
			System.out.println("Case #"+(cas+1)+": "+ans);
		}
	}
}