Codeforces Round 925 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

games

greedy

math

sortings

*1400

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Anna and the Valentine's Day Gift

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSasha gave Anna a list $$$a$$$ of $$$n$$$ integers for Valentine's Day. Anna doesn't need this list, so she suggests destroying it by playing a game.

Players take turns. Sasha is a gentleman, so he gives Anna the right to make the first move.

- On her turn, Anna must choose an element $$$a_i$$$ from the list and reverse the sequence of its digits. For example, if Anna chose the element with a value of $$$42$$$, it would become $$$24$$$; if Anna chose the element with a value of $$$1580$$$, it would become $$$851$$$. Note that leading zeros are removed. After such a turn, the number of elements in the list does not change.
- On his turn, Sasha must extract two elements $$$a_i$$$ and $$$a_j$$$ ($$$i \ne j$$$) from the list, concatenate them in any order and insert the result back into the list. For example, if Sasha chose the elements equal to $$$2007$$$ and $$$19$$$, he would remove these two elements from the list and add the integer $$$200719$$$ or $$$192007$$$. After such a turn, the number of elements in the list decreases by $$$1$$$.

Players can't skip turns. The game ends when Sasha can't make a move, i.e. after Anna's move there is exactly one number left in the list. If this integer is not less than $$$10^m$$$ (i.e., $$$\ge 10^m$$$), Sasha wins. Otherwise, Anna wins.

It can be shown that the game will always end. Determine who will win if both players play optimally.

Input

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

Then follows the description of the test cases.

The first line of each test case contains integers $$$n$$$, $$$m$$$ ($$$1 \le n \le 2 \cdot 10^5$$$, $$$0 \le m \le 2 \cdot 10^6$$$) — the number of integers in the list and the parameter determining when Sasha wins.

The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ ($$$1 \le a_i \le 10^9$$$) — the list that Sasha gave to Anna.

It is guaranteed that the sum of $$$n$$$ for all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, output:

- "Sasha", if Sasha wins with optimal play;
- "Anna", if Anna wins with optimal play.

Example

Input

92 214 23 59 56 14 101 2007 800 15804 55000 123 30 410 106 4 6 2 3 1 10 9 10 71 161 1108 91 2 9 10 10 2 10 24 510 10 10 10

Output

Sasha Anna Anna Sasha Sasha Anna Anna Anna Sasha

Note

Consider the first test case.

Anna can reverse the integer $$$2$$$, then Sasha can concatenate the integers $$$2$$$ and $$$14$$$, obtaining the integer $$$214$$$, which is greater than $$$10^2 = 100$$$. If Anna had reversed the integer $$$14$$$, Sasha would have concatenated the integers $$$41$$$ and $$$2$$$, obtaining the integer $$$412$$$, which is greater than $$$10^2 = 100$$$. Anna has no other possible moves, so she loses.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2024 04:02:03 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|