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

package com.sam.googlecodejam.recyclenumbers;

import java.util.HashSet;
import java.util.Set;

import com.sam.googlecodejam.helper.InputReader;

public class RecycleNumbers {
	long pairCount;

	public void getPairCount(long a, long b) {
		int length = Long.toString(a).length();

		long power = 1;
		for (int i = 1; i < length; i++) {
			power = power * 10;
		}

		for (long m = a; m < b; m++) {
			long value = m;
			Set<Long> pairCountSet = new HashSet<>();
			for (int i = 0; i < length; i++) {
				value = value / 10 + (value % 10) * power;

				if (value > m && value <= b) {

					pairCountSet.add(value);
				}
			}
			pairCount = pairCount + pairCountSet.size();
		}
	}

	public static void main(String[] args) {

		InputReader reader = new InputReader("c://input.in");
		reader.readNextLine(); // read the line number off - we don't need it

		String lineRead = null;
		int i = 1;
		while ((lineRead = reader.readNextLine()) != null) {
			RecycleNumbers recycleNumbers = new RecycleNumbers();

			String values[] = lineRead.split(" ");
			recycleNumbers.getPairCount(Long.parseLong(values[0]),
					Long.parseLong(values[1]));
			System.out.println("Case #" + i + ": " + recycleNumbers.pairCount);
			i++;
		}
	}
}
