测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A12279. Digital root

编程题 普及/提高-

题目描述

Today at the lesson of mathematics, Petya learns about the digital root.

The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached.

Let's denote the digital root of $x$ as $S(x)$ . Then $S(5)=5$ , $S(38)=S(3+8=11)=S(1+1=2)=2$ , $S(10)=S(1+0=1)=1$ .

As a homework Petya got $n$ tasks of the form: find $k$ -th positive number whose digital root is $x$ .

Petya has already solved all the problems, but he doesn't know if it's right. Your task is to solve all $n$ tasks from Petya's homework.

输入格式

The first line contains a single integer $n$ ( $1 \le n \le 10^3$ ) — the number of tasks in Petya's homework. The next $n$ lines contain two integers $k_i$ ( $1 \le k_i \le 10^{12}$ ) and $x_i$ ( $1 \le x_i \le 9$ ) — $i$ -th Petya's task in which you need to find a $k_i$ -th positive number, the digital root of which is $x_i$ .

输出格式

Output $n$ lines, $i$ -th line should contain a single integer — the answer to the $i$ -th problem.

输入输出样例

输入 #1
3
1 5
5 2
3 1
输出 #1
5
38
19
上一题 去做题 下一题