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

import java.io.File;

import io.Reader;

public class CycloMatic {
	public static void main(String[] args){
		new CycloMatic();
	}
	
	public CycloMatic(){
		String[] lines = Reader.getInput(new File("C-small-attempt0.in"));
		
		
		for(int i = 0; i < lines.length; i++){
			String line = lines[i];
			String[] lineParts = line.split(" ");
			int bottom = Integer.parseInt(lineParts[0]);
			int top = Integer.parseInt(lineParts[1]);
			int sum = 0;
			for(int j = bottom; j<top; j++){
				int q = numCycles(j,top);
				if (q!=0){
					sum+=q;
				}
			}
			System.out.println("Case #"+(i+1)+": "+sum);
		}
			
		
	}
	
	public int numCycles(int original, int max){
		int counter = 0;
		String newIntS = cycle(original);
		int newInt = Integer.parseInt(newIntS);
		for (int i = 0; i < (original+"").length();i++){
			if(newInt>original && newInt<=max){
				counter++;
			}
			newIntS = cycle(newIntS);
			newInt = Integer.parseInt(newIntS);
		}
		return counter;
	}
	
	
	public String cycle(int j){
		return cycle(j+"");
	}
	
	public String cycle(String j){
		String s = j+"";
		char ss=s.charAt(s.length()-1);
		s = s.substring(0,s.length()-1);
		return ss+s;
	}
}
