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;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class Numbers {
	public static void main (String[] args) throws IOException {
		
		Scanner sc = new Scanner(new FileReader("numbers.in"));
		PrintWriter out = new PrintWriter(new FileWriter("NumbersClarge.out"));
		int cases = sc.nextInt();
		
		for (int i = 0; i < cases; i++) {
			String aString = sc.next();
			String bString = sc.next();
			int a = Integer.parseInt(aString);
			int b = Integer.parseInt(bString);
			int count = 0;
			
			for (int j = a; j <= b; j++) {
				String currentString = String.valueOf(j);
				ArrayList<String> list = new ArrayList<String>();
					for (int k = 1; k < currentString.length(); k++) {
						
						String thisNewString = currentString.substring(currentString.length() - k, currentString.length()) + currentString.substring(0, currentString.length() - k);

						if (isAnagram(currentString, thisNewString)) {

						if (Integer.parseInt(thisNewString) >= a && Integer.parseInt(thisNewString) <= b && !currentString.equals(thisNewString)) {
							if (!list.contains(thisNewString)) {
								count++;
							}
							list.add(thisNewString);
						}
					}
				}
			}
			out.println("Case #" + (i + 1) + ": " + count/2);
			
		}
		out.close();
	}
	
	public static boolean isAnagram(String s1, String s2) {
		
		int[] char_set = new int[10];
		
		if(s1.length() != s2.length()) {
			return false;
		}
		
		for (int i = 0; i < s1.length(); i++) {
			char_set[s1.charAt(i) % 48]++;
		}
		
		for (int j = 0; j < s1.length(); j++) {
			char_set[s1.charAt(j) % 48]--;
		}
		
		for(int k = 0; k < char_set.length; k++) {
			if (char_set[k] != 0) {
				return false;
			}
		}
		
		return true;
	}
}
