import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package test;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author Jeric Bryle Sy Dy
 */
public class GJamC2 {

	private static class Ref {

		public int cnt;
		public Set<String> set;

		public Ref() {
			cnt = 0;
			set = new HashSet<String>();
		}
	}

	private static void permuteMove(char[] arr, int len, String strN, String strB, Ref ref) {
		int arrLen = arr.length;
		char[] result = new char[arrLen];

		int index = 0;
		for (int i = arrLen - len; i < arrLen; ++i) {
			result[index++] = arr[i];
		}
		for (int i = 0; i < arrLen - len; ++i) {
			result[index++] = arr[i];
		}

		String strCur = new String(result);
		if (strCur.compareTo(strN) > 0 && strCur.compareTo(strB) <= 0 && !ref.set.contains(strCur)) {
			ref.set.add(strCur);
			++ref.cnt;
		}
	}

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new FileReader("C:/Users/Jeric Bryle Sy Dy/Downloads/C-large.in"));
		PrintWriter out = new PrintWriter("C:/Users/Jeric Bryle Sy Dy/Downloads/C-large.out");

		int t = Integer.parseInt(br.readLine());

		for (int tIter = 0; tIter < t; ++tIter) {
			Scanner s = new Scanner(br.readLine());

			int a = s.nextInt();
			int b = s.nextInt();

			Ref ref = new Ref();

			for (int n = a; n < b; ++n) {
				ref.set.clear();
				String strN = String.valueOf(n);
//				permute(strN.toCharArray(), 0, strN, String.valueOf(b), 1, ref);
				for (int len = 1; len < strN.length(); len++) {
					permuteMove(strN.toCharArray(), len, strN, String.valueOf(b), ref);
				}
			}

			s.close();

			out.printf("Case #%d: %d\n", tIter + 1, ref.cnt);
		}

		br.close();
		out.close();
	}
}
