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();
		}
	}
}

package bsevero.codejam.qualification;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	
	private static Set<String> FOUND_PAIRS = new HashSet<String>();

	public static int recycle(String minStr, String maxStr) {
		FOUND_PAIRS = new HashSet<String>();
		int min = Integer.valueOf(minStr);
		int max = Integer.valueOf(maxStr);
		
		int total = 0;
		for(int i = min; i <= max; i++) {
			total += calculate(i, min, max);
		}
		
		return total;
	}
	
	private static int calculate(int value, int min, int max) {
		String valueStr = String.valueOf(value);
		
		if(valueStr.length() < 2) {
			return 0;
		}
		
		int count = 0;
		for(int numDigits = 1; numDigits < valueStr.length(); numDigits++) {
			String newValueStr = valueStr.substring(valueStr.length() - numDigits, valueStr.length()) + valueStr.substring(0, valueStr.length() - numDigits);
			int newValue = Integer.valueOf(newValueStr);
			if(newValue > value && newValue <= max) {
				if(!FOUND_PAIRS.contains(value + " " + newValue)) {
					FOUND_PAIRS.add(value + " " + newValue);
					count++;
				}
				
			}
		}
		
		return count;
	}
	
	
}

