/*
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;


public class C {
	public static void main(String[] args) {
		// split table
		int split[] = new int[10];
		for (int i = 0; i < split.length; i++) {
			split[i] = (int)Math.pow(10, i);
		}
		
		// read input
		CaseC[] cases = read("C-small-attempt0.in");
		int front, back, size, m, a, b;
		// calculate each case
		for (CaseC c : cases) {
			// in each case
			size = c.getSize();
			a = c.getA();
			b = c.getB();
			for (int n = a; n <= b; n++) {
				// for each value in range [A, B]
				for (int i = size - 1; i > 0; i--) {
					front = n / split[i];
					back = n % split[i];
					
					if (back < split[i-1]) {
						// ignore case with leading zero(s) in "back" part
						//System.err.printf("Leading zero at position %d in number %d\n", i, n);
						continue;
						
					}
					
					m = back * split[size - i] + front;
					if (m > n && m <= b) {
						c.increment(n, m);
					}
				}
			}
		}
		
		// write output
		writeFile(cases, "C-small-attempt0.out");
		print("Complete!");
	}
	
	public static void printf(String format, Object... args) {
		System.out.printf(format, args);
	}
	
	public static void print(Object o) {
		System.out.println(o);
	}
	
	public static void writeFile(CaseC[] result, String out) {
		PrintWriter writer = null;
		try {
			writer = new PrintWriter(out);
			for (int i = 0; i < result.length; i++) {
				writer.printf("Case #%d: %s\n", i+1, result[i]);
			}
			writer.flush();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
			if (writer != null) {
				writer.close();
			}
		}
	}
	
	public static CaseC[] read(String file) {
		BufferedReader reader = null;
		CaseC[] cases = null;
		try {
			reader = new BufferedReader(new FileReader(file));
			
			// get test case count
			int caseCount = Integer.parseInt(reader.readLine());
			cases = new CaseC[caseCount];
			for (int i = 0; i < cases.length; i++) {
				String[] paramStr = reader.readLine().split(" ");
				cases[i] = new CaseC(Integer.parseInt(paramStr[0]), Integer.parseInt(paramStr[1]));
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
			if (reader != null) {
				try {
					reader.close();
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
		}
		return cases;
	}
}

class CaseC {
	private int a;
	private int b;
	private int size;
	//private int count; 
	private HashSet<String> set; 
	
	public CaseC(int a, int b) {
		this.a = a;
		this.b = b;
		this.size = String.valueOf(b).length();
		this.set = new HashSet<String>();
		//System.out.printf("A=%d, B=%d, Size=%d\n", a, b, size);
	}
	
	public int getA() {
		return a;
	}
	
	public int getB() {
		return b;
	}
	
	public int getSize() {
		return size;
	}

	public void increment(int n, int m) {
		
		String s = n + ":" + m;
		if (set.contains(s)) {
			//System.err.println("Duplicated entry: " + s);
		} else {
			set.add(s);
			//count++;
		}
	}
	
	public int getCount() {
		//return count;
		return set.size();
	}
	
	@Override
	public String toString() {
		return "" + set.size();
	}
}