import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

package gcj;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

class Recycled {
	Scanner sc;
	PrintWriter pw;
	
	int t, a, b, n, m, y;

	Recycled() {
		try {
			sc = new Scanner(new File("C-small-attempt0.in"));
			pw = new PrintWriter(new FileWriter("out-small.txt"));
		} catch (IOException e) {
		}
		
		t = sc.nextInt();
		int caseNum = 1;
		
		while (caseNum <= t) {
			y = 0;
			a = sc.nextInt();
			b = sc.nextInt();
			
			n = a;
			m = b;
			while (n < m) {
				while (m > n) {
					recycle(n, m);
					m--;
				}
				n++;
				m = b;
			}
			pw.println("Case #" + caseNum + ": " + y);
			caseNum++;
		}
		pw.flush();
		pw.close();
	}

	void recycle(int a, int b) {
		char[] n = String.valueOf(a).toCharArray();
		char[] m = String.valueOf(b).toCharArray();
		char[] shifted = null;

		for (int i = n.length - 1; i > 0; i--) {
			shifted = shift(n, i);
			if (equal(shifted, m)) {
				this.y++;
				return;
			}
		}
	}

	private char[] shift(char[] x, int start) {
		char[] ret = new char[x.length];

		int i = start;
		for (int j = 0; j < x.length; j++) {
			if (i < x.length) {
				ret[j] = x[i];
				i++;
			} else {
				i = 0;
				ret[j] = x[i];
				i++;
			}
		}
		return ret;
	}

	boolean equal(char[] a, char[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] != b[i])
				return false;
		}
		return true;
	}

	public static void main(String[] args) {
		new Recycled();
	}

}
