
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Recycle {

	private BufferedReader br;
	private int numCases;
	
	public Recycle(String input){
		try{
		FileInputStream fstream = new FileInputStream(input);
		DataInputStream in = new DataInputStream(fstream);
		 br = new BufferedReader(new InputStreamReader(in));
		
		 numCases = Integer.parseInt(br.readLine());
		 
		 for(int i=0;i<numCases;i++){
			 System.out.print("Case #"+(i+1)+": ");
			this.Calculate(br.readLine());
			 
		 }
				 
		 in.close();
		}
	catch (Exception e){
		  System.err.println("Error: " + e.getMessage());
		  }
	}
	
	
	private void Calculate(String s){
		StringTokenizer st = new StringTokenizer(s);
		int start=Integer.parseInt(st.nextToken());
		int end=Integer.parseInt(st.nextToken());
		int count=0;
		for(int i=start;i<end;i++){
			for(int j=i+1;j<=end;j++){
				if(check(i,j))count++;
				
			}
		}
		System.out.println(count);
		
		
	}
	
	private boolean check(int n,int m){
		String n1=Integer.toString(n);
		String m1=Integer.toString(m);
		char[]n2=n1.toCharArray();
		char[]m2=m1.toCharArray();
		
		int[][]sum= new int[n1.length()+1][m1.length()+1];
		
		for(int i=1;i<=n1.length();i++){
			for(int j=1;j<=n1.length();j++){
				if(n2[i-1]==m2[j-1]){
					if(i-1>=0 || j-1>=0 )sum[i][j]=sum[i-1][j-1]+1;
					else sum[i][j]=1;
				}
				else sum[i][j]=0;
			}
		}
		
		
		for(int i=1;i<n1.length();i++){
			if(sum[n1.length()][i]>0){
				if(sum[n1.length()-i][n1.length()]==(n1.length()-sum[n1.length()][i])){
					
					return true;
				}
			}
		}
		return false;
	}
	
	
	public static void main(String[] args) {
		
		Recycle r = new Recycle("input3.txt");

	}

}
