CF1277A.Happy Birthday, Polycarp!

Hooray! Polycarp turned $n$ years old! The Technocup Team sincerely congratulates Polycarp!

Polycarp celebrated all of his $n$ birthdays: from the $1$-th to the $n$-th. At the moment, he is wondering: how many times he turned beautiful number of years?

According to Polycarp, a positive integer is beautiful if it consists of only one digit repeated one or more times. For example, the following numbers are beautiful: $1$, $77$, $777$, $44$ and $999999$. The following numbers are not beautiful: $12$, $11110$, $6969$ and $987654321$.

Of course, Polycarpus uses the decimal numeral system (i.e. radix is 10).

Help Polycarpus to find the number of numbers from $1$ to $n$ (inclusive) that are beautiful.

太棒了！Polycarp 年满 $n$ 岁了！Technocup 团队向 Polycarp 表示诚挚的祝贺！

Polycarp 庆祝了他全部 $n$ 个生日：从第 $1$ 个到第 $n$ 个。此刻，他正在思考：在他所有生日中，有多少次他度过了“优美的”岁数？

在 Polycarp 看来，一个正整数是优美的，当且仅当它由同一个数字重复一次或多次构成。例如，以下数字是优美的：$1$、$77$、$777$、$44$ 和 $999999$；而以下数字则不是优美的：$12$、$11110$、$6969$ 和 $987654321$。

当然，Polycarp 使用的是十进制记数法（即基数为 $10$）。

请帮助 Polycarp 找出从 $1$ 到 $n$（含端点）之间优美数字的个数。

The first line contains an integer $t$ ($1 \le t \le 10^4$) — the number of test cases in the input. Then $t$ test cases follow.

Each test case consists of one line, which contains a positive integer $n$ ($1 \le n \le 10^9$) — how many years Polycarp has turned.

第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 输入中测试用例的数量。随后是 $t$ 个测试用例。

每个测试用例由一行组成，其中包含一个正整数 $n$（$1 \le n \le 10^9$）—— Polycarp 的年龄（岁数）。

Print $t$ integers — the answers to the given test cases in the order they are written in the test. Each answer is an integer: the number of beautiful years between $1$ and $n$, inclusive.

输出 $t$ 个整数——即按测试用例在输入中出现的顺序，依次输出各测试用例的答案。每个答案均为一个整数：表示在 $1$ 到 $n$（含端点）之间“优美年份”的个数。

In the first test case of the example beautiful years are $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ and $11$.

在示例的第一个测试用例中，优美的年份是 $1$、$2$、$3$、$4$、$5$、$6$、$7$、$8$、$9$ 和 $11$。