Mattey has an assignment that he should submit tomorrow. The assignment has one question which asks to write a program to multiply two numbers without using ''* operator. As Mattey finds no interest in this subject, he never listens to classes and so do not know about shift operators.

He comes to you to learn about this topic. You can explain in any manner you wish. But for this question, given N and M, write an equation using left shift operators whose result will be equal to the product $N*M$.

Input :
First line has T denoting number of test cases.
Next T lines has two integers $N,M$.

Output :
For each test case print an equation resembling "(N<< $p_1$) + (N << $p_2$) + ... + (N << $p_k$)" (without quotes) where $p_1$ ≥ $p_2$ ≥ ... ≥ $p_k$ and k is minimum.

Constraints :
$1 ≤ T ≤ 5*10$ ⁴
$1 ≤ N,M ≤ 10$ ^$16$