void solve() {
  ll n, m;
  cin >> n >> m;

  vll v(n);
  readV(v);

  auto p = [&](string s){
    cout << s << nl;
    return;
  };
  auto len = [&](ll x) -> ll{
    ll l = 0;
    while(x){
      l ++ ;
      x /= 10;
    }
    return l;
  };

  vll zeros;
  ll digits = 0;
  for(int i = 0;i<n;i++) {
    ll rem = v[i] % 10;
    if(rem == 0)
      zeros.push_back(v[i]);
    else 
      digits += len(v[i]);
  }

  if(zeros.empty()) {
    if(digits > m) p("Sasha");
    else p("Anna");
    return;
  }

  sort(all(zeros), [&](ll a, ll b)->bool{
    int cnt1 = 0, cnt2 = 0;
    while(a){
      if(a % 10 != 0) break;
      cnt1 ++;
      a /= 10;
    }
    while(b){
      if(b % 10 != 0) break;
      cnt2 ++;
      b /= 10;
    }
    return cnt1 > cnt2;
  });

  for(int i = 0;i<zeros.size();i++) {
    if(i & 1) {
      digits += len(zeros[i]);
    }
    else {
      int cnt = 0;
      int a = zeros[i];
      while(a){
        if(a % 10 != 0) break;
        cnt ++;
        a /= 10;
      }
      digits += max(0LL, (len(zeros[i]) - cnt));
    }
  }
  
  if(digits > m) p("Sasha");
  else p("Anna");
}