import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

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

public class C extends CodeJammer {

	public void process() throws IOException {
		long[] input = reader.readLongArray();
		long a = input[0];
		long b = input[1];
		int digits = 0;
		long a1 = a;
		while (a1>0) {
				  a1 /= 10;
				  digits++;
		}
		long total = 0;
		for (long x=a; x<=b; x++) {
			total += count(x,a,b, digits);
		}
		output(total);
	}

	public long count(long x, long a, long b, int d) {
		Set<Long> s = new HashSet<Long>();
		long y = x;
		for (int i=1; i<d; i++) {
			y = rotate(y,d);
			if (y>x && y>=a && y<=b) s.add(y);
  		}
		return s.size();		
	}

	public long rotate(long y, int d) {
		long digit = y%10;
		long rest = y/10;
		digit *= Math.pow(10,d-1);
		return digit + rest;
	}

	public static void main(String[] args) {
			  C c = new C();
			  c.run(args);
	}

}
