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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;

public class RecycledNumber {
	
	private void solve(BufferedReader f, PrintWriter out) throws IOException {
		int T = read(f);
		HashSet<String> set = new HashSet<String>();
		
		for (int i=0; i<T; i++) {
			int count = 0;
			int[] a = read(f, 2);
			int A = a[0];
			int B = a[1];
			
			for (int n=A; n<B; n++) {
				String s = "" + n;
				for (int j=0; j<s.length()-1; j++) {
					s = s.substring(1) + s.charAt(0);
					if (s.charAt(0) == '0' || set.contains(s)) continue;
					
					set.add(s);
					int m = Integer.parseInt(s);
					if (m > n && m <= B) {
						count++;
					}
				}
				
				set.clear();
			}
			
			out.println("Case #" + (i+1) + ": " + count);
		}
	}
	
	public int read(BufferedReader f) throws IOException {
		return Integer.parseInt(f.readLine());
	}
	
	public int[] read(BufferedReader f, int N) throws IOException {
		String[] t = f.readLine().split(" ");
		int[] a = new int[N];
		for (int i=0; i<N; i++) {
			a[i] = Integer.parseInt(t[i]);
		}
		return a;
	}

	public static void main(String[] args) throws IOException {
		String name = "C-large";
		
		BufferedReader f = new BufferedReader(new FileReader("F:/CodeJam/problem3/" + name + ".in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(
				"F:/CodeJam/problem3/" + name + ".out")));
		new RecycledNumber().solve(f, out);
		out.close();
	}

}
