import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

package trupti;


import java.io.*;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class ok2 
{
    public static void main(String[] args) 
	{
		int cn=0;
        
        try 
		{
            
			FileOutputStream out=new FileOutputStream("out9.out");
            Scanner scanner = new Scanner(new FileReader("C-small-attempt6.in"));
			int n=scanner.nextInt();
		//	scanner.nextLine();
            while (n!=cn) {
				cn++;
				int q=0;
				int a=scanner.nextInt();
				int b=scanner.nextInt();
				int no=0;
				for(int r=a;r<=b;r++)
				{ 
					String str=r+"";
				//	System.out.println("str"+str);
					do{
						char c=str.charAt(0);
						String str1=str.substring(1, str.length()); 
						str=str1+c;
					//	System.out.println(str);
						no=Integer.parseInt(str);
					//	System.out.println("no"+no);
						if((no<r)&(a<=no)&(no<=b))
						{//System.out.println("no:"+no+"  r:  "+r);
							q++;
						}
						
					}while(no!=r);
				}


				out.write(("Case #"+cn+": "+q+"\n").getBytes());
				
				// out.write(("\n").getBytes());
				 System.out.println("Case #"+cn+": "+q);
				 //System.out.println();
            }
        } catch (Exception e) {}
                
	}
}