CF1811E.Living Sequence

In Japan, the number $4$ reads like death, so Bob decided to build a live sequence. Living sequence $a$ contains all natural numbers that do not contain the digit $4$. $a = [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, \ldots]$.

For example, the number $1235$ is part of the sequence $a$, but the numbers $4321$, $443$ are not part of the sequence $a$.

Bob realized that he does not know how to quickly search for a particular number by the position $k$ in the sequence, so he asks for your help.

For example, if Bob wants to find the number at position $k = 4$ (indexing from $1$), you need to answer $a_k = 5$.

在日本，数字 $4$ 的读音与“死亡”相似，因此鲍勃决定构建一个“活序列”。活序列 $a$ 包含所有不包含数字 $4$ 的自然数：$a = [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, \ldots]$。

例如，数字 $1235$ 属于序列 $a$，但数字 $4321$、$443$ 不属于序列 $a$。

鲍勃意识到自己无法快速根据位置 $k$ 在该序列中查找特定的数，因此他向你求助。

例如，若鲍勃想查找位置 $k = 4$（下标从 $1$ 开始）处的数，则你需要回答 $a_k = 5$。

The first line of input data contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

In the only line of each test case, there is a single integer $k$ ($1 \le k \le 10^{12}$) — the position Bob is interested in.

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

每个测试用例仅一行，包含一个整数 $k$（$1 \le k \le 10^{12}$）——Bob 所关注的位置。

For each test case, print on a separate line the number $a_k$ in indexing with $1$.

对于每个测试用例，在单独一行中输出索引从 $1$ 开始的数 $a_k$。