Stjepan recently received his bachelor’s degree in mathematics from the University
of Zagreb. Naturally, his parents are very proud and have decided to give him
all positive integers not greater than \(2^{60}\) as a gift. To keep them safe, he quickly
stored all of those numbers in an array \(A\), such that \(A\)\(i = i\).
His jealous friend Marin decided to prank him by repeatedly replacing each
element of \(A\) with the sum of its digits until all elements of \(A\) consisted of a
single digit. For example, the initial value of \(197^{th}\) element of \(A\) was 197. Marin
first changed that value to \(1 + 9 + 7 = 17\) and then changed its value again to
\(1 + 7 = 8\).
Stjepan is devastated and begs Marin to return his array to its initial state.
Unfortunately, Marin won’t do that until Stjepan correctly answers his \(Q\) queries:
“What is the sum of numbers from \(l-th\) to \(r-th\) element of \(A\)?”.
Help Stjepan answer those queries!

In test cases worth a total of 10 points, for each query will hold \(1 \le l@@RISE_MATH_BLOCK_0@@i \le 9\).
In test cases worth a total of 30 points, for each query will hold \(r@@RISE_MATH_BLOCK_1@@i \le 1000\).

The first line contains an integer \(Q\) (\(1 \le Q \le 100\)) from the task description.
The next \(Q\) lines contain two integers \(l@@RISE_MATH_BLOCK_0@@i\) (\(1 \le l@@RISE_MATH_BLOCK_1@@i \le 2^{60}\)), the parameters of Marin’s \(i-th\) query.

Output the answers to each of Marin’s \(Q\) queries. Each answer should be printed in a separate line and
their order should match the order of the queries as they are given in the input.

생성자가 기록되지 않았습니다.

출처 COCI 2019/2020 Contest 1