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 it.simone.google.code.jam2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class GoogleCodeJamManager {
	
	public static void main(String[] args) {
//		GoogleCodeExercise tm = new Translator();
//		GoogleCodeJamManager.execute("inputFile_Translator.in","outputFile_Translator.out",tm);
//		GoogleCodeExercise dancer = new Dancer();
//		GoogleCodeJamManager.execute("inputFile_Dancer.in","outputFile_Dancer.out",dancer);
		GoogleCodeExercise recycled = new RecycledNumber();
		GoogleCodeJamManager.execute("inputFile_Recycled.in","outputFile_Recycled.out",recycled);
	}

	public static void execute(String inputFile,String outputFile,GoogleCodeExercise exercise) {

		BufferedReader br = null;
		BufferedWriter bw=null;
		int testNumber=0;
		
		try {
			exercise.initialize();
			br = new BufferedReader(new FileReader(inputFile));
			bw=new BufferedWriter(new FileWriter(outputFile));
			String line = br.readLine();
			testNumber=Integer.parseInt(line);
			line=br.readLine();
			int testCounter=1;
			while (line != null) {
				System.out.println("Test" +testCounter +"/"+testNumber+ "\t Line=" + line);
				String translatedLine=exercise.execute(line);
				bw.write("Case #"+testCounter+": "+translatedLine+"\n");
				line=br.readLine();
				testCounter++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}finally {

			try {
				if (br != null)
					br.close();
				if(bw!=null)
					bw.close();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}		
	}

}
