#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b,ll MOD){ll res=1;a%=MOD;while(b){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;}

int main(){
    ll n,m;cin>>n>>m;
    ll a=modpow(10,n,m*m);
    out(a/m);
}
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>

#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)

using ll = long long;

int main() {
    ll N, K;
    std::cin >> N >> K;
    
    std::vector<ll> sum2cnt(2*N-1);
    for (ll i = 0; i < 2*N-1; i++) {
        sum2cnt[i] = std::min(i + 1, 2*N - i - 1);
    }
    // i, j, kをとりあえず0-indexedで出す
    K--;
    ll begin = 0, end = 1, ijk = 0, dif = 1;
    while (K >= end) {
        ijk++;
        begin = end;
        if (ijk < 2*N-1) {
            dif += sum2cnt[ijk];
        }
        if (ijk - N >= 0) {
            dif -= sum2cnt[ijk - N];
        }
        end += dif;
        // std::cerr << begin << ' ' << end << ' ' << ijk << std::endl;
    }

    ll jk = ijk;
    end = begin + (jk < 2*N - 1 ? sum2cnt[jk] : 0);
    // std::cerr << jk << ' ' << sum2cnt[jk] << ' ' << begin << ' ' << end << std::endl;
    for (; K >= end; jk--, begin = end, end += (jk < 2*N - 1 ? sum2cnt[jk] : 0)); //std::cerr << begin << ' ' << end << ' ' << jk << std::endl;;

    // std::cerr << begin << ' ' << end << ' ' << jk << std::endl;
    // std::cerr << ijk << ' ' << jk << std::endl;
    ll i = ijk - jk;
    ll j = jk - std::min(jk, N-1) + K - begin;
    ll k = jk - j;
    std::cout << i + 1 << ' ' << j + 1 << ' ' << k + 1 << '\n';

    return 0;
}