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

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

package recycled;
import java.io.*;
import java.util.StringTokenizer;
import java.util.HashSet;

class Par{
    long x;
    long y;
    Par(long a, long b){x=a;y=b;};
    @Override
    public int hashCode() {
        return (int) ((int) x+y);
    }

    @Override
    public boolean equals(Object obj) {
        if (obj == null) {
            return false;
        }
        if (getClass() != obj.getClass()) {
            return false;
        }
        final Par other = (Par) obj;
        if (this.x != other.x) {
            return false;
        }
        if (this.y != other.y) {
            return false;
        }
        return true;
    }
}
class Solucionar{
    long buscar(String base, String techo){
        long ret = 0;
        HashSet<Par> cjto = new HashSet<Par>();
        
        if ((base.length() == techo.length())||(base.length()==1)){
            int tam = (int) Math.pow(10 , base.length() - 1);
            int veces = base.length() - 1;
            
            int inicio = Integer.parseInt(base);
            int fin =  Integer.parseInt(techo);
            
            for (int i=inicio;i<fin;i++){
                int original = i;
                int numero = i;
                
                for (int h=0;h<veces;h++){
                    int cabeza = numero / tam;
                    int cola = numero % tam;
                    numero = cabeza + cola*10;
                    if  (  (original >= inicio)
                           && ( numero > original)
                            && ( fin >= numero)
                         ) 
                    {   
                        Par ingresar =  new Par(original,numero);
                        if (! cjto.contains(ingresar))
                        {  //System.err.println(original + " + " + numero);
                           ret++;
                           cjto.add(ingresar);
                        }
                    }
                    
                }
                
            }
            
            
            
            //System.err.print(tam);
        }
        
        return ret;
    }
}
public class Recycled{
    public static void main(String[] args) throws Exception{
        Solucionar s = new Solucionar();
        //s.buscar("1000000", "2333444");
        //s.buscar("1111","2222");
        
        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader (isr);
        
        String linea;
        linea = br.readLine();
        int casos = Integer.parseInt(linea);
        
        for (int i=0;i<casos;i++){
            linea = br.readLine();
            StringTokenizer tk = new StringTokenizer(linea);
            String base = tk.nextToken();
            String techo = tk.nextToken();
            long ret = s.buscar(base, techo);
            System.out.println("Case #"+ (i+1) + ": " + ret );
        }
        
    }
}
