#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    string Y = "yuusaan";
    ll N, K;
    cin >> N >> K;
    vector<ll> A = {0, 3}, B = {0, 4}, C = {0, 7};
    while (true){
        A.push_back(A.back() + B.back() * 3);
        B.push_back(B.back() * 4);
        C.push_back(A.back() + B.back());
        if (C.back() > K) break;
    }
    int lim = A.size() - 1;
    K--;
    auto f = [&](auto self, ll n, ll k) -> char {
        if (n == 1) return Y[k];
        if (k < n) return 'y';
        if (n - 1 > lim){
            return self(self, lim + 1, k - (n - 1 - lim));
        }
        k--;
        rep(rp, 0, 2){
            if (k < C[n - 1]) return self(self, n - 1, k);
            k -= C[n - 1];
        }
        if (k == 0) return 's';
        k--;
        rep(rp, 0, 2){
            if (k < C[n - 1]) return self(self, n - 1, k);
            k -= C[n - 1];
        }
        assert(k == 0);
        return 'n';
    };
    cout << f(f, N, K) << "\n";
}