import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package codejam.c;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

import codejam.TestCaseReader;

public class Main {

	public static void main(String[] args) {

		TestCaseReader<int[]> reader = new TestCaseReader<int[]>("in.txt") {

			@Override
			protected int[] parseTestCase(String line) {
				String[] splitted = line.split("\\s");
				return new int[] { Integer.parseInt(splitted[0]),
						Integer.parseInt(splitted[1]) };
			}
		};

		BufferedWriter writer = null;
		try {
			writer = new BufferedWriter(new FileWriter(new File("out.txt")));
		} catch (IOException e) {
			e.printStackTrace();
		}
		int testCases = reader.getTestCases();

		int[] testCase = null;

		for (int i = 0; i < testCases; i++) {
			testCase = reader.getNextTestCase();
			long result = Main.solveCase(testCase[0], testCase[1]);
			try {
				writer.write("Case #" + (i + 1) + ": " + result);
				writer.newLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		try {
			writer.flush();
			writer.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	private static long solveCase(int a, int b) {

		char[] bArray = Main.converToCharArray(b);

		Set<String> counted = new HashSet<String>();

		for (int num = a; num <= b; num++) {
			char[] numArray = Main.converToCharArray(num);
			char[] numArrayPair = Main.converToCharArray(num);

			for (int i = 0; i < numArray.length - 1; i++) {
				Main.rotateCharArray(numArrayPair);

				if (Main.compare(numArrayPair, bArray) <= 0
						&& Main.compare(numArray, numArrayPair) < 0) {

					String pair = new String(numArray)
							+ new String(numArrayPair);
					if (!counted.contains(pair)) {
						counted.add(pair);
					}

				}
			}
		}

		return counted.size();
	}

	private static char[] converToCharArray(int num) {
		return new Integer(num).toString().toCharArray();
	}

	private static void rotateCharArray(char[] array) {
		char tmp = array[array.length - 1];
		for (int i = array.length - 1; i > 0; i--) {
			array[i] = array[i - 1];
		}
		array[0] = tmp;
	}

	private static int compare(char[] a, char[] b) {

		for (int i = 0; i < a.length; i++) {
			if (a[i] < b[i]) {
				return -1;
			} else if (a[i] > b[i]) {
				return 1;
			}
		}
		return 0;
	}
}
