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));
	}
}


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


public class Recycling {
    
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        FileInputStream file = new FileInputStream("C:\\Users\\Taghi\\Downloads\\C-small-attempt1.in");
        DataInputStream in2 = new DataInputStream(file);
        Scanner in=new Scanner(new InputStreamReader(in2));
        int numberOfTests=in.nextInt();
        int[] results=new int[numberOfTests];
        for (int i=0;i<numberOfTests;i++)
        {
            int lowerBound=in.nextInt();
            int higherBound=in.nextInt();
            //System.out.println(lowerBound+" "+higherBound);
            int possibilities=0;
            for (int k=lowerBound;k<=higherBound;k++)
            {
                for (int j=k+1;j<=higherBound;j++)
                {
                    String clone=Integer.toString(j);
                    for (int l=0;l<clone.length();l++)
                    {
                        String newClone=clone.substring(clone.length()-l-1,clone.length())+clone.substring(0,clone.length()-l-1);
                        int check=Integer.parseInt(newClone);
                        if (check==k)
                        {
                            possibilities++;
                        }
                    }
                }
            }
            //System.out.println(possibilities);
            results[i]=possibilities;
        }
        for (int i=0;i<numberOfTests;i++)
        System.out.println("Case #"+(i+1)+": "+results[i]);
    }
}
