import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

package info.stephenn.codejam2012.qualify;

import java.util.Scanner;

public class C {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int cases = sc.nextInt();
		for (int caseX=1; caseX <= cases; caseX+=1){
			int A = sc.nextInt();
			int B = sc.nextInt();
			System.out.println("Case #"+caseX+": "+doit(A,B));
		}
	}
	
	public static int doit(int A, int B){
		int count=0;
		for (int m = A+1; m <= B; m++){
			for (int n = A; n < m; n++){
				count += isRecycledString(Integer.toString(n), Integer.toString(m));
			}
		}
		return count;
	}
	
	public static int countRecycled(int n, int m){
		int count=0;
		
		System.out.println("countRecycled"+n+","+m);
		
		int split = 10;
		
		while (true){
			
			if (split > n) break;
			
			int front = n/ split;
			int behind = n %split;
			int behindInfront = behind * split;
			int t = behindInfront + front;
			
			if (t ==m){
				System.out.println(""+t+" == "+m+" split"+split+" n"+n);
				count +=1;
			}
			split = split * 10;
		}
		return count;
	}
	
	public static int isRecycledString(String n, String m){
		for (int split =1; split < n.length(); split++){
			String t = n.substring(split) + n.substring(0, split);
			if (t.equals(m))
				return 1;
		}
		return 0;
	}
}