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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class Solver2 {
	public static void main(String[] args) {
		new Solver2();
	
	}
	private Scanner in;
	public Solver2(){
		try {
			in = new Scanner(new File("../Text/C-small-attempt0.in"));
		} catch (FileNotFoundException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		

		solve();

		in.close();

	}
	public void solve() {
		int cases = in.nextInt();
		ArrayList<Integer> solutions=new ArrayList<Integer>();
		for (int i = 1; i <= cases; i++) {
			int lower=in.nextInt();
			int upper=in.nextInt();
			int amount=0;
			for(int k= lower;k<=upper;k++){//k van lower tot upper
				if(k>=10){
					String iString=String.valueOf(k);
					ArrayList<Integer> allreadyPaired=new ArrayList<Integer>();
					for (int l = 1; l < iString.length(); l++) {
						String shifted=move(l,iString);	
						int reverseInt=Integer.parseInt(shifted);
						if(reverseInt<=upper&&reverseInt>lower&&reverseInt>k){
							if(!allreadyPaired.contains(reverseInt))
								amount++;
							solutions.add(k);
						}
						allreadyPaired.add(reverseInt);
					}
				}
			}
			System.out.println("Case #"+i+": "+amount);
			solutions.clear();
		}
	}

	private String move(int i,String iString) {
		String result="";
		for (int j = 0; j < i; j++) {
			String letter=String.valueOf(iString.charAt(iString.length()-i+j));
			result+=letter;
		} 
		for (int j = 0; j < iString.length()-i; j++) {
			String letter=String.valueOf(iString.charAt(j));
			result+=letter;
		}
		return result;
			
		
		
	}
}
