7463: X Number

Teitoku loves many different kinds of numbers, and today Little W wants him to classify some positive integers into different categories.
There are 11categories, numbered from 0to 10. For each positive integer x, if there exists only one type of digit d(0≤d≤9)that occurs in xwith the highest frequency, then we say xshould be classified into category d, or otherwise, in case such digit doesn't exist, we say xshould be classified into category 10.
For example,
    ● 111223should be classified into category 1since digit 1occurs three times, and digits 2and 3occur less than three times respectively, and
    ● 3345544should be classified into category 4since digit 4occurs three times, and digits 3and 5occur less than three times respectively, and
    ● 112233should be classified into category 10since digits 1, 2and 3occur twice respectively.
Little W doesn't care about category 10and he just wants Teitoku to tell him the number of integers ranged from lto rthat should be classified to another category d. However, Teitoku can hardly solve this problem, so he asks you for help.

There are several test cases.
The first line contains an integer T(1≤T≤1000), denoting the number of test cases. Then follow all the test cases.
For each test case, the only line contains three integers l, rand d(1≤l≤r≤1018,0≤d≤9), representing a problem.

For each test case, output in one line the number of integers ranged from lto rthat should be classified to category d.