import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

package com.problemC;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

class RecyclePair {

	int n, m;

	public RecyclePair(int a, int b) {
		assert (a < b);
		n = a;
		m = b;
	}

	@Override
	public boolean equals(Object obj) {
		if (obj instanceof RecyclePair) {
			RecyclePair o = (RecyclePair) obj;
			if (this.n == o.n && this.m == o.m)
				return true;
		}
		return false;
	}

	@Override
	public int hashCode() {
		return n * m;
	}

}

public class RecycledNumber {

	private static int A = 1111;
	private static int B = 2222;
	public static int count = 0;
	static Set<RecyclePair> pairs = null;

	public static void main(String[] args) {
		String[] s;
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader(
					"src/com/problemC/C-large.in"));
			// br = new BufferedReader(
			// new FileReader("src/com/problemC/input.txt"));
			int caseNo = 1;
			int T = Integer.parseInt(br.readLine());
			while (caseNo <= T) {
				count = 0;
				pairs = new HashSet<RecyclePair>();
				s = br.readLine().split(" ");
				A = Integer.parseInt(s[0]);
				B = Integer.parseInt(s[1]);
				for (int i = A; i < B; i++) {
					rotate(i);
				}
				System.out.println("Case #" + caseNo++ + ": " + pairs.size());
			}
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				if (br != null) {
					br.close();
				}
			} catch (IOException e) {
				e.printStackTrace();
			}

		}
	}

	private static void rotate(int num) {
		int l = (num + "").length(), l2;
		int toCut = 1;
		int original = num, newNum;
		String s = num + "", firstPart, secondPart;
		// if(num%10==0) return;
		// System.out.println("");
		// System.out.println("Original Number in question: " + s);
		for (toCut = 0; toCut <= l; toCut++) {
			firstPart = s.substring(0, l - toCut);
			secondPart = s.substring(l - toCut);
			newNum = Integer.parseInt(secondPart + firstPart);
			// System.out.println(firstPart + " " + secondPart + ": " + newNum);
			l2 = (newNum + "").length();
			if (l == l2 && (original < newNum && newNum <= B)) {
				RecyclePair rp = new RecyclePair(original, newNum);
				if (!pairs.add(rp)) {
					// System.out.println("NO ***********************************************");
				}
				// System.out.println("YES : " + original + " " +
				// newNum+" "+count);
				// System.out.println("");
				count++;
			}
		}
	}
}
