import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class ProblemC {
	
	static Scanner kb = null;
	static FileWriter fw = null;
	
	public static void main(String [] args) {
		
		try {
			kb = new Scanner(new File("input.in"));
		} catch (FileNotFoundException e) {}
		
		
		
		
		int T = kb.nextInt();
		
		//int result = solve(1111, 2222);
		//System.out.println("Case #"+2+": "+result);
		
		
		FileWriter fstream = null;
		try {
			fstream = new FileWriter("output.txt");
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		BufferedWriter out = new BufferedWriter(fstream);
		  
		for(int i=1; i<=T; i++) {
			int A = kb.nextInt();
			int B = kb.nextInt();
			
			int result = solve(A, B);
			
			try {
				out.append("Case #"+i+": "+result+"\n");
				//out.write("Case #"+i+": "+result);
			} catch (IOException e) {
				System.out.println("error "+e.getMessage() );
			}
			//System.out.println("Case #"+i+": "+result);
		}
		 try {
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	
	public static int solve(int A, int B) { // 100 500
		
		int count = 0;
		for(int i=A; i<=B; i++) {
			
			String istr = i+""; // 100
			String icyc = istr + istr; // 100100
			
			int len = istr.length();
			
			//System.out.println("cyc: "+icyc);
			
			ArrayList<Integer> savedInts = new ArrayList<Integer>();
			
			savedInts.add(i);	
			
			for(int j=1; j<len; j++) {
				String recyc = icyc.substring(j, j+len);
				int recycInt = Integer.parseInt(recyc);
				
				//System.out.println("> "+recycInt);
				
				if(recycInt <= B && recycInt>=A && !savedInts.contains(recycInt)) {
					//System.out.println("*");
					savedInts.add(recycInt);
					count++;
				}
			}
		}
		
		return count/2;
	}
}
