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

import java.util.*;
import java.io.*;

class B
{
	public static void main(String[]args)
	{
		try
		{
			Scanner sc=new Scanner(new File("C-small-attempt0.in"));
			
			int count=sc.nextInt();
			String blank=sc.nextLine();
			
			PrintWriter pr=new PrintWriter(new FileWriter("BAnswer0.in"));
			
			for(int i=1; i<=count; i++)
			{
				int a=sc.nextInt();
				int b=sc.nextInt();
				
				int possible=0;
				
				for (int m=a; m<b; m++)
				{
					for(int n=m+1; n<=b; n++)
					{
						String strM=""+m;
						String strN=""+n;
						
						int lenM=strM.length();
						int lenN=strN.length();
						
						boolean test=false;
						
						if(m!=n&&m<n&&lenM==lenN)
						{
							String[]check=new String [lenM*lenM];
							int checkCount=0;
							
							for(int y=0; y<lenM; y++)//start pos
							{				
								String strTest="";//m arranged
								
								for(int z=y; z<y+lenM; z++)//new pos
								{
									int pos=z;
									
									while(pos>=lenM)
										pos-=lenM;
										
									strTest=strTest+strM.charAt(pos);
								}
								
								if(strTest.equals(strN))
								{
									boolean boolCheck=true;
									
									for(int c=0; c<checkCount; c++)
									{
										if(strTest.equals(check[c]))
											boolCheck=false;
									}
									
									if(boolCheck)
									{
										check[checkCount]=strTest;
										checkCount++;
										possible++;
									}
									
									
								}
								
							}
						}
					}
				}
				
				pr.println("Case #"+i+": "+possible);
			}
			
			pr.close();
		}
		catch (FileNotFoundException e)
		{
			System.out.println(e);
		}
		
		catch(IOException f)
		{
			System.out.println(f);
		}	
	}
	
	public static boolean checkRecycle(int m, int n)
	{
		String strM=""+m;
		String strN=""+n;
		
		int lenM=strM.length();
		int lenN=strN.length();
		
		boolean test=false;
		
		if(m!=n&&m<n&&lenM==lenN)
		{
			for(int y=0; y<lenM; y++)//start pos
			{				
				String strTest="";//m arranged
				
				for(int z=y; z<y+lenM; z++)
				{
					int pos=z;
					
					while(pos>=lenM)
						pos-=lenM;
						
					strTest=strTest+strM.charAt(pos);
				}
				
				if(strTest.equals(strN))
				{
					test= true;
				//	System.out.println(strTest+" "+strM+" "+strN);
				}
						else
							test= false;
				
			}
		}else
			test= false;
			
			return test;
	}
}