Codeforces Round 929 (Div. 3) A B C D E

A. Turtle Puzzle: Rearrange and Negate

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given an array $a$ of $n$ integers. You must perform the following two operations on the array (the first, then the second):

1. Arbitrarily rearrange the elements of the array or leave the order of its elements unchanged.
2. Choose at most one contiguous segment of elements and replace the signs of all elements in this segment with their opposites. Formally, you can choose a pair of indices $l,r$ such that $1\le l\le r\le n$ and assign $a_i=-a_i$ for all $l\le i\le r$ (negate elements). Note that you may choose not to select a pair of indices and leave all the signs of the elements unchanged.

What is the maximum sum of the array elements after performing these two operations (the first, then the second)?

Input

The first line of the input contains a single integer $t$ ($1\le t\le 1000$) — the number of test cases. The descriptions of the test cases follow.

The first line of each test case contains a single integer $n$ ($1\le n\le 50$) — the number of elements in array $a$.

The second line of each test case contains $n$ integers $a_1,a_2,\dots ,a_n$ ($-100\le a_i\le 100$) — elements of the array.

Output

For each test case, output the maximum sum of the array elements after sequentially performing the two given operations.

Example

input

8
3
-2 3 -3
1
0
2
0 1
1
-99
4
10 -2 -3 7
5
-1 -2 -3 -4 -5
6
-41 22 -69 73 -15 -50
12
1 2 3 4 5 6 7 8 9 10 11 12

output

8
0
1
99
22
15
270
78

Tutorial

输出所有元素的绝对值之和，即 ${\sum }_{i=0}^{i=n}|a_i|$

Solution

for _ in range(int(input())):
    input()
    a = list(map(int, input().split()))
    print(sum(abs(ai) for ai in a))

---

B. Turtle Math: Fast Three Task

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given an array $a_1,a_2,\dots ,a_n$.

In one move, you can perform either of the following two operations:

• Choose an element from the array and remove it from the array. As a result, the length of the array decreases by $1$;
• Choose an element from the array and increase its value by $1$.

You can perform any number of moves. If the current array becomes empty, then no more moves can be made.

Your task is to find the minimum number of moves required to make the sum of the elements of the array $a$ divisible by $3$. It is possible that you may need $0$ moves.

Note that the sum of the elements of an empty array (an array of length $0$) is equal to $0$.

Input

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

The first line of each test case contains a single integer $n$ ($1\le n\le 10^5$).

The second line of each test case contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^4$).

The sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, output a single integer: the minimum number of moves.

Example

input

8
4
2 2 5 4
3
1 3 2
4
3 7 6 8
1
1
4
2 2 4 2
2
5 5
7
2 4 8 1 9 3 4
2
4 10

output

1
0
0
1
1
2
1
1

Note

In the first test case, initially the array $a=[2,2,5,4]$. One of the optimal ways to make moves is:

• remove the current $4$th element and get $a=[2,2,5]$;

As a result, the sum of the elements of the array $a$ will be divisible by $3$ (indeed, $a_1+a_2+a_3=2+2+5=9$).

In the second test case, initially, the sum of the array is $1+3+2=6$, which is divisible by $3$. Therefore, no moves are required. Hence, the answer is $0$.

In the fourth test case, initially, the sum of the array is $1$, which is not divisible by $3$. By removing its only element, you will get an empty array, so its sum is $0$. Hence, the answer is $1$.

Tutorial

• 如果对 3 取余等于 0，则需要 0 次操作
• 如果对 3 取余等于 2，则需要 1 次添加操作即可
• 如果对 3 取余等于 1：
  • 若数组中有一个元素对 3 取余等于 1，删除这个元素即可
  • 否则做两次添加操作

Solution

for _ in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))
    ans = (3 - sum(a) % 3) % 3
    for ai in a:
        if ai % 3 == 3 - ans:
            ans = min(ans, 1)
    print(ans)

---

C. Turtle Fingers: Count the Values of k

time limit per test: 5 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given three positive integers $a$, $b$ and $l$ ($a,b,l>0$).

It can be shown that there always exists a way to choose non-negative (i.e. $\ge 0$) integers $k$, $x$, and $y$ such that $l=k\cdot a^x\cdot b^y$.

Your task is to find the number of distinct possible values of $k$ across all such ways.

Input

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

The following $t$ lines contain three integers, $a$, $b$ and $l$ ($2\le a,b\le 100$, $1\le l\le 10^6$) — description of a test case.

Output

Output $t$ lines, with the $i$-th ($1\le i\le t$) line containing an integer, the answer to the $i$-th test case.

Example

input

11
2 5 20
2 5 21
4 6 48
2 3 72
3 5 75
2 2 1024
3 7 83349
100 100 1000000
7 3 2
2 6 6
17 3 632043

output

6
1
5
12
6
11
24
4
1
3
24

Note

In the first test case, $a=2,b=5,l=20$. The possible values of $k$ (and corresponding $x,y$) are as follows:

• Choose $k=1,x=2,y=1$. Then $k\cdot a^x\cdot b^y=1\cdot 2^2\cdot 5^1=20=l$.
• Choose $k=2,x=1,y=1$. Then $k\cdot a^x\cdot b^{}$