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


public class RecycledNumbers {

	public RecycledNumbers() {
	}
	
	public int sumOfDigit (int x)
	{
		int sum = 0;
		while (x >0) 
		{
			sum+=x%10;
			x /=10;
		}
		return sum ;
	}
	
	String n ;
	String m ;
	String temp1_1 ;
	
	public boolean Recycled(int x,int y,int begin) // y > x 
	{
		if (x == y)
			return false ;
		
		if (sumOfDigit(x) != sumOfDigit(y))
			return false ;
		
		n = x+"" ;
		temp1_1 = x+"" ;
		m = y+"" ;
		
		
		while (begin< n.length() && n.charAt(begin) != m.charAt(0))
			begin++;
		
//		System.out.println("i = " + begin);
		
		if (begin == n.length())
			return false ;
		
		n = n.substring(begin);
		n += temp1_1.substring(0,begin);
		
//		System.out.println("1 = " + n);
//		System.out.println("2 = " +m);
		
		if (n.equals(m))
			return true ;
		if (begin<n.length())
			return Recycled(x, y, begin+1);
		else
			return false ;
	}
	
	public int numOfDisRecNum (int min , int max)
	{
		int counter = 0 ;
		
		for (int n =min;n<max;n++)
			for (int m=n+1 ;m<= max ;m++)
			{
				if (Recycled(n,m,0))
					counter ++ ;
			}
		
		return counter;
	}
	public static void main(String[] args) {
		
		RecycledNumbers obj = new RecycledNumbers();
		
		System.out.println(obj.numOfDisRecNum(1111 , 2222));
		
//		System.out.println(obj.Recycled(244,424,0));
		
//		System.out.println(obj.Recycled(12345,34512,0));
		
	}
}

