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

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;

public class c {

	public static void solve() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader("c.txt"));
		PrintWriter out = new PrintWriter(new File("c-out.txt"));
		String s = "";
		int t = Integer.parseInt(br.readLine());
		// int t = 105;
		Queue<Integer> q;
		for (int i = 0; i < t; i++) {
			int count = 0;
			s = br.readLine();
			String x[] = s.split(" ");
			int A = Integer.parseInt(x[0]);
			int B = Integer.parseInt(x[1]);

			for (int j = A; j < B; j++) {
				for (int j2 = j + 1; j2 <= B; j2++) {
					q = new LinkedList<Integer>();
					int n = j;
					int m = j2;
					int m2 = m;
					int sumn = 0, summ = 0;
					while (n > 0) {
						q.add(n % 10);

						sumn += (n % 10);
						summ += (m2 % 10);

						m2 = m2 / 10;
						n = n / 10;
					}

					if (summ != sumn)
						continue;

					int len = q.size();
					for (int k = 0; k < len - 1; k++) {
						q.add(q.remove());
						// System.out.println(q);
						int c = 1;
						int nn = 0;
						for (Integer integer : q) {
							nn = nn + (integer * c);
							c *= 10;
						}
						// System.out.println(nn);
						if (m == nn) {
							count++;
							break;
						}
					}

				}
			}
			out.println("Case #" + (i + 1) + ": " + count);
		}
		out.close();
	}

	public static void main(String[] args) throws Exception {
		/*
		 * int n = 12345; Queue<Integer> q = new LinkedList<Integer>(); int m =
		 * 0; while (n > 0) { q.add(n%10); //System.out.print(n % 10);
		 * //System.out.println(m); n = n/10;
		 * 
		 * }
		 * 
		 * int len = q.size(); for (int j = 0; j < len-1; j++) {
		 * q.add(q.remove()); System.out.println(q); int c = 1; int nn =0; for
		 * (Integer integer : q) { nn = nn + (integer*c); c *= 10; }
		 * System.out.println(nn); }
		 * 
		 * //System.out.println(1234568 % 10); String sa = "687248"; //char[]
		 * sac = sa.toCharArray(); //Arrays.sort(sac); //System.out.println(new
		 * String(sac)); BigInteger b = new BigInteger("123");
		 * 
		 * //int n = 16; //System.out.println(n>>3);
		 */
		c.solve();

	}

}
