write a go solution for B. Floor or Ceiltime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputEcrade has an integer x. There are two kinds of operations.  Replace x with lfloordfracx2rfloor, where lfloordfracx2rfloor is the greatest integer <=dfracx2.  Replace x with ceil(dfracx2), where ceil(dfracx2) is the smallest integer >=dfracx2. Ecrade will perform exactly n first operations and m second operations in any order. He wants to know the minimum and the maximum possible value of x after n+m operations. However, it seems a little difficult, so please help him!InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). The description of the test cases follows. The only line of each test case contains three integers x, n, and m (0<=x,n,m<=10^9).OutputFor each test case, print two integers in one line, representing the minimum and the maximum possible value of x after n+m operations.ExampleInput512 1 212 1 112 0 012 1000000000 1000000000706636307 0 3Output1 2
3 3
12 12
0 0
88329539 88329539
NoteFor simplicity, we call the first operation OPER1 and the second operation OPER2.In the first test case:  If we perform 12xarrowOPER26xarrowOPER23xarrowOPER11, we can obtain the minimum possible value 1.  If we perform 12xarrowOPER26xarrowOPER13xarrowOPER22, we can obtain the maximum possible value 2.. Output only the code with no comments, explanation, or additional text.