import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;

public class c {

	public static void solve() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader("c.txt"));
		PrintWriter out = new PrintWriter(new File("c-out.txt"));
		String s = "";
		int t = Integer.parseInt(br.readLine());
		// int t = 105;
		Queue<Integer> q;
		for (int i = 0; i < t; i++) {
			int count = 0;
			s = br.readLine();
			String x[] = s.split(" ");
			int A = Integer.parseInt(x[0]);
			int B = Integer.parseInt(x[1]);

			for (int j = A; j < B; j++) {
				for (int j2 = j + 1; j2 <= B; j2++) {
					q = new LinkedList<Integer>();
					int n = j;
					int m = j2;
					int m2 = m;
					int sumn = 0, summ = 0;
					while (n > 0) {
						q.add(n % 10);

						sumn += (n % 10);
						summ += (m2 % 10);

						m2 = m2 / 10;
						n = n / 10;
					}

					if (summ != sumn)
						continue;

					int len = q.size();
					for (int k = 0; k < len - 1; k++) {
						q.add(q.remove());
						// System.out.println(q);
						int c = 1;
						int nn = 0;
						for (Integer integer : q) {
							nn = nn + (integer * c);
							c *= 10;
						}
						// System.out.println(nn);
						if (m == nn) {
							count++;
							break;
						}
					}

				}
			}
			out.println("Case #" + (i + 1) + ": " + count);
		}
		out.close();
	}

	public static void main(String[] args) throws Exception {
		/*
		 * int n = 12345; Queue<Integer> q = new LinkedList<Integer>(); int m =
		 * 0; while (n > 0) { q.add(n%10); //System.out.print(n % 10);
		 * //System.out.println(m); n = n/10;
		 * 
		 * }
		 * 
		 * int len = q.size(); for (int j = 0; j < len-1; j++) {
		 * q.add(q.remove()); System.out.println(q); int c = 1; int nn =0; for
		 * (Integer integer : q) { nn = nn + (integer*c); c *= 10; }
		 * System.out.println(nn); }
		 * 
		 * //System.out.println(1234568 % 10); String sa = "687248"; //char[]
		 * sac = sa.toCharArray(); //Arrays.sort(sac); //System.out.println(new
		 * String(sac)); BigInteger b = new BigInteger("123");
		 * 
		 * //int n = 16; //System.out.println(n>>3);
		 */
		c.solve();

	}

}
