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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;

import java.util.Scanner;

/**
 *
 * @author Abdo
 */
public class problemb {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        sc.nextLine();
        int[] a=new int[n];
        int[] b=new int[n];
        for(int k=0;k<n;k++)
        {
             a[k]=sc.nextInt();
             b[k]=sc.nextInt();
             sc.nextLine();
        }
        for(int k=0;k<n;k++)
        {
            int count=0;
            int i=-1;
            int num=0;
            while(a[k]+i <= b[k])
            {
                i++;
                String temp=new String();
                int alo=a[k]+i;
                temp=String.valueOf(alo);
                char[] abdo=temp.toCharArray();
                if(abdo.length<2)
                    break;
                else if(abdo.length ==2)
                {
                    char temp2=abdo[0];
                    abdo[0]=abdo[1];
                    abdo[1]=temp2;
                    String aaa= String.valueOf(abdo[0])+ String.valueOf(abdo[1]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num > a[k]+i)
                        count++;
                    
                }
                else
                {
                   char[] temp5=abdo;
                    char temp2=abdo[0];
                    char temp3=abdo[1];
                    abdo[0]=abdo[2];
                   abdo[1]=temp2;
                   abdo[2]=temp3;
                    
                    String aaa= String.valueOf(abdo[0])+ String.valueOf(abdo[1])+String.valueOf(abdo[2]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num >= a[k] && num >a[k]+i)
                        count++;
                    
                  char[] abdo2=temp.toCharArray();
                      temp2=abdo2[0];
                     temp3=abdo2[2];
                    abdo2[0]=abdo2[1];
                    abdo2[1]=temp3;
                    abdo2[2]=temp2;
                    
                       aaa= String.valueOf(abdo2[0])+ String.valueOf(abdo2[1])+String.valueOf(abdo2[2]);
                    
                    num=Integer.parseInt(aaa);
                    if(num <= b[k] && num >= a[k] && num > a[k]+i)
                        count++;
                    
                }
                
               
            }
            System.out.format("Case #%d: %d\n", k+1, count);
        }
    }
    
}
