import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

import java.io.*;
import java.util.*;

public class clarge {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		int[][] list = new int[2000000][];


		for (int i=0; i<2000000; i++) {
			list[i] = fill(i);
		}

		int numCases = stdin.nextInt();

		for (int loop=1; loop<=numCases; loop++) {

			int A = stdin.nextInt();
			int B = stdin.nextInt();

			int sum = 0;
			for (int i=A; i<=B; i++) {

				if (list[i] != null) {
					for (int j=0; j<list[i].length; j++)
						if (list[i][j] <= B)
							sum++;
				}

			}
			System.out.println("Case #"+loop+": "+sum);
		}

	}

	public static int[] fill(int val) {

		if (val < 10) return null;

		int[] temp = new int[7];

		int index = 0;

		int saveval = val;

		int numdigits = numd(val);

		for (int i=0; i<numdigits; i++) {

			val = rotate(saveval, val, numdigits);

			if (val > saveval) {
				temp[index] = val;
				index++;
			}
		}

		int[] ans = new int[index];
		for (int i=0; i<index; i++)
			ans[i] = temp[i];

		return ans;

	}

	public static int rotate(int orig, int val, int numd) {
		return (val%10)*pow10(orig) + val/10;
	}

	public static int pow10(int val) {

		if (val == 0) return 0;

		int cnt = 1;
		while (val >= 10) {

			cnt*=10;
			val /= 10;
		}
		return cnt;
	}

	public static int numd(int val) {

		if (val == 0) return 0;

		int cnt = 0;
		while (val > 0) {

			cnt++;
			val /= 10;
		}
		return cnt;
	}
}
