package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map.Entry;
import java.util.Set;

public class CodeJam
{

    private Set<Integer> generateCombination(Integer i, Integer max)
    {
        final Set<Integer> output = new HashSet<Integer>();
        final Integer len = String.valueOf(i).length();

        Integer num = i;
        double pow = Math.pow(10, len - 1);

        for (int j = 0; j < len - 1; ++j)
        {
            num = (int) ((num % pow) * 10 + (num / pow));
            if (num > i && num <= max)
                output.add(num);
        }

        return output;
    }

    private List<HashMap<Integer, Integer>> getInputValue()
    {
        List<HashMap<Integer, Integer>> inpVal = new ArrayList<HashMap<Integer, Integer>>();

        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
        try
        {
            final String tc_ = stdin.readLine();
            Integer testCase = Integer.parseInt(tc_);

            while (testCase-- > 0)
            {
                // System.err.println("tc#" + testCase);
                final String[] input = stdin.readLine().split(" ");
                final int min = Integer.parseInt(input[0]);
                final int max = Integer.parseInt(input[1]);

                inpVal.add(new HashMap<Integer, Integer>() {
                    {
                        put(min, max);
                    }
                });
            }

            return inpVal;
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }

        return null;
    }

    public static void main(String[] args)
    {
        CodeJam cj = new CodeJam();
        List<HashMap<Integer, Integer>> inp = cj.getInputValue();
        int count = 1;

        for (HashMap<Integer, Integer> tc : inp)
        {

            // operating for tc
            int min = 0, max = 0;
            int answer = 0;
            for (Entry<Integer, Integer> e : tc.entrySet())
            {
                min = e.getKey();
                max = e.getValue();
            }
            for (int i = min; i <= max; ++i)
            {
                answer += cj.generateCombination(i, max).size();
            }
            System.out.println("Case #" + count++ + ": " + answer);

        }

        // System.err.println(cj.generateCombination(24, 40));
    }
}
