import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.util.*;

public class JuanjeProblemaC 
{
	public static void main(String[] args){
		Scanner entrada = new Scanner(System.in);
		int tam = entrada.nextInt();
		for(int problema = 1; problema <= tam;problema++)
		{
			int A = entrada.nextInt();
			int B = entrada.nextInt();
			int resultado = 0;
			for(int indice=A;indice<=B;indice++) 
			{
			
				ArrayList<Integer> pares = new ArrayList<Integer>();
				String ns = indice+"";
				for (int j=ns.length()-1;j>0;j--) {
					String k = ns.substring(j);
					String nuevoVal = k + ns.substring(0,j);
					int m = Integer.parseInt(nuevoVal);
					if (m>indice && A<m && B>=m) 
					{ 
						if (pares.indexOf(m)==-1)
							pares.add(m);
					}
				}
				int tamPares = pares.size();
				resultado += tamPares;
			}
			
			System.out.format("Case #%d: %d\n", problema, resultado);
		}
	}
	
}