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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {

	int noOfTestCases = 0;
	int[][] testData;
	
	
	public static void main ( String[] args ) {
		
		String fileName = "C-large.in";
		
		if ( args.length > 0 ) {
			fileName = args[0];
		}
		
		RecycledNumbers rn = new RecycledNumbers ( );
		
		try {
			rn.readInputFile ( fileName );
		}
		catch ( IOException e ) {
			System.err.println ( "Problem reading the input file" );
			e.printStackTrace();
		}
		//rn.getRotatedNumbers ( "123456" );
		rn.processTestData ( );
	}
	
	private void processTestData ( ) {
		
		for ( int i = 0; i < noOfTestCases; i++ ) {
			Set < String > unique = new HashSet < String >(); 
			int from = testData[i][0];
			int to = testData[i][1];
			
			for ( int j = from; j <= to; j++ ) {
				int[] rotatedNumbers = getRotatedNumbers ( "" + j );
				
				checkIfValid ( rotatedNumbers, j, from, to, unique );
			}
			System.out.println ( "Case #" + (i+1) + ": " + unique.size ( ));
		}
		
	}
	
	private void checkIfValid ( int[] in, int current, int from, int to, Set < String > unique ) {
		
	
		for ( int i = 0; i < in.length; i++ ) {
			int number = in[i];
			if ( number < from ) {
				
			}
			else if ( number > to ) {
				
			}
			else if ( number <= current ) {
				
			}
			else {
				//System.out.println ( number );
				unique.add ( ""+ number + current );
			}
		}
	}
	
	private int[] getRotatedNumbers ( String input ) {
		
		int length = input.length ( );
		int[] output = new int[length-1];
		char[] outstring = input.toCharArray();
		
		for (int i = 0; i < length-1; i++)  { //Length-1 or length?
			char ch = outstring[length - 1];
			for (int j = length - 1; j > 0; j--)  {
				outstring[j] = outstring[j - 1];
			}
			outstring[0] = ch;
			output[i] = Integer.parseInt ( new String(outstring ) );
			
		}
		
		return output;
		
	}
	
	private void readInputFile ( String fileName ) throws IOException {
		
		BufferedReader br = new BufferedReader ( new FileReader ( fileName ) );
		noOfTestCases = Integer.parseInt ( br.readLine ( ) );
		testData = new int[noOfTestCases][2];
		
		for ( int i = 0; i < noOfTestCases; i++ ) {
			String[] data = br.readLine ( ).split ( " " );
			testData[i][0] = Integer.parseInt ( data[0] );
			testData[i][1] = Integer.parseInt ( data[1] );
		}
	}
}
