import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.BufferedWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Scanner;
import javax.swing.JOptionPane;

public class Pair
{
    private int A;
    private int B;
    private int pairs;

    public Pair(int A, int B)
    {
        this.A = A;
        this.B = B;
        this.pairs = 0;
    }

    public int getA()
    {
        return this.A;
    }

    public int getB()
    {
        return this.B;
    }

    public int getPairs()
    {
        return this.pairs;
    }

    public String snake(String the_string, int position)
    {
        int len = the_string.length();
        int point = len - position;
        String end = the_string.substring(point);
        String build = end + the_string.substring(0, point);
        return build;
    }

    public void finder(int base, int limit)
    {
        ArrayList<String> doubles = new ArrayList<String>();
        String the_base = Integer.toString(base);
        int len = the_base.length();

        for(int i = 1; i < len; i++)
        {
            String answ = this.snake(the_base, i);

            if(!doubles.contains(answ))
            {
                int answer = Integer.parseInt(answ);

                if(answer <= limit && base < answer)
                {
                    doubles.add(answ);
                    this.pairs++;
                }
            }
        }
    }

    public void find_pairs()
    {
        int the_A = this.A;

        while(the_A < this.B)
        {
            this.finder(the_A, this.B);
            the_A++;
        }
    }

    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        String file = JOptionPane.showInputDialog("Enter the name of the file you wish to use.");
        Scanner in = new Scanner(new FileReader(file));
        FileWriter fstream = new FileWriter("out.txt");
        BufferedWriter out = new BufferedWriter(fstream);

        String integ = in.nextLine();
        int cases = Integer.parseInt(integ);

        for(int i = 0; i < cases; i++)
        {
            String ab = in.nextLine();
            Scanner abs = new Scanner(ab);
            String a = abs.next();
            String b = abs.next();
            int int_a = Integer.parseInt(a);
            int int_b = Integer.parseInt(b);

            Pair current = new Pair(int_a, int_b);
            current.find_pairs();

            System.out.println("Case #" + (i + 1) + ": " + current.getPairs());

            out.write("Case #" + (i + 1) + ": " + current.getPairs() + "\r\n");
        }
        out.close();
    }
}
