Optimization is Freaky Fun

Time limit2sMemory limit256 MB

Summary

For each query with N, S, and E up to 10^12, print the value that Kyojun's program outputs.

Problem

The following is the source code written by Kyojun.

<Figure 1> Source code written by Kyojun

The input of the program written by Kyojun is as follows:

Q
N1 S1 E1
N2 S2 E2
...
NQ SQ EQ

Write a program that prints the output of the program written by Kyojun.

The first line contains a natural number $Q$ .

The $(i+1)$ -th line contains three natural numbers $N_i$ , $S_i$ , and $E_i$ , separated by spaces ( $1 \le i \le Q$ ).

From the first line to the $Q$ -th line, print the output of the program written by Kyojun.

All input data satisfy the following conditions.