#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int L = 25;
  ll n, k; cin >> n >> k; --k;
  if (k < n) {
    cout << "y\n";
    return 0;
  }
  array<ll, L + 1> level{};
  level[1] = 7;
  FOR(i, 2, L + 1) level[i] = level[i - 1] + (1LL << ((i - 1) * 2)) * 6;
  const auto calc = [&](auto calc, const int l, ll index) -> char {
    if (l == 1) {
      assert(index < 7);
      return "yuusaan"[index];
    }
    if (index == 0) return 'y';
    --index;
    REP(_, 2) {
      if (index < level[l]) return calc(calc, l - 1, index);
      index -= level[l];
    }
    if (index == 0) return 's';
    --index;
    REP(_, 2) {
      if (index < level[l]) return calc(calc, l - 1, index);
      index -= level[l];
    }
    assert(index == 0);
    return 'n';
  };
  if (n > L) {
    k -= n - L;
    n = L;
  }
  cout << calc(calc, n, k) << '\n';
  return 0;
}