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 me.stapel.kai.google.codejam2012.quali;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.SortedSet;
import java.util.TreeSet;

import me.stapel.kai.google.codejam2012.quali.C.Pair;

public class ProblemC {

	private static final String NL = System.getProperty("line.separator");

	public ProblemC() {
		// nothing to do here yet
	}
	
	public static void main(String[] args) {
		ProblemC problemC = new ProblemC();
		
		problemC.processFile("in/C-large.in", "out/C-large.txt");
	}

	private Object processFile(String inFileName, String outFileName) {
		Object obj = new Object();
		
		File inFile = new File(inFileName);
		File outFile = new File(outFileName);

		String line = "";
		int T = 1;

		OutputStreamWriter output;
		BufferedReader br;
		try {
			br = new BufferedReader(new FileReader(inFile));
			output = new OutputStreamWriter(new BufferedOutputStream(
					new FileOutputStream(outFile)), "8859_1");

			line = br.readLine();
			
			// skipping first line
			line = br.readLine();

			while (line != null) {
				String[] split = line.split(" ");

				int A = Integer.parseInt(split[0]);
				int B = Integer.parseInt(split[1]);

				int numPairs = calcNumPairs(A, B);
				
				output.write("Case #" + T + ": " + numPairs + NL);
				System.out.println("Case #" + T + ": " + numPairs);
				
				line = br.readLine();
				T++;
			}
			
			
			output.flush();
			output.close();

		} catch (FileNotFoundException e) {
			System.err.println("File " + inFile.getName() + " not found. Nothing processed.");
			e.printStackTrace();
		} catch (IOException e) {
			System.err.println("Error when reading file " + inFile.getName() + " or writing file " + outFile.getName() + ".");
			e.printStackTrace();
		}
		
		return obj;
	}
	
	private int calcNumPairs(int A, int B) {
		SortedSet<Pair> pairs = new TreeSet<Pair>();
		
		for(int i = A; i <= B; i++){
			int[] n = toArray(i);

			calcRecycledPairs(n, B, pairs);
		}
		
		return pairs.size();
	}

	private int calcRecycledPairs(int[] n, int B, SortedSet<Pair> pairs) {
		int num = 0;
		int[] m = new int[n.length];
		int ni,mi;
		
		for (int i = 1; i < n.length; i++) {
			for(int j = 0; j < n.length-i; j++) {
				m[j+i] = n[j];
			}
			for(int j = n.length-i; j < n.length; j++) {
				m[j-n.length+i] = n[j];
			}
			
			ni = fromArray(n);
			mi = fromArray(m);
			
			if(mi <= B && ni < mi && isValidM(m)) {
				num++;
				pairs.add(new Pair(ni, mi));
//				System.out.println("("+ni+", "+mi+")");
			}
				
		}
		
		return num;
	}

	private boolean isValidN(int[] n) {
		int tmp = n[0];
		for (int i = 1; i < n.length; i++) {
			if(n[i] != tmp)
				return true;
			tmp = n[i];
		}
		return false;
	}

	private boolean isValidM(int[] m) {
		if(fromArray(m) < Math.pow(10,m.length-1))
			return false;
		return true;
	}

	private int[] toArray(int i) {
		int digits = (int)Math.ceil(Math.log10(i+1));
		int[] arr = new int[digits];
		
		for(int c = 1; c<=digits;c++) {
			arr[digits-c] = i % 10;
			i = i/10;
		}
		
		return arr;
	}
	
	private int fromArray(int[] arr) {
		int i = 0;
		for (int j = 0; j < arr.length; j++) {
			i = 10*i+arr[j];
		}
		return i;
	}
}
