#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long int llint; typedef long double lldo; #define mp make_pair #define mt make_tuple #define pub push_back #define puf push_front #define pob pop_back #define pof pop_front #define fir first #define sec second #define res resize #define ins insert #define era erase #define RE return 0 //ios::sync_with_stdio(false); //std::cin.tie(0); //<< setprecision(20) const int mod=1e9+7; const int big=1e9+100; const long double pai=3.141592653589793238462643383279502884197; const long double ena=2.71828182845904523536; const long double eps=1e-7; template void mineq(T& a,U b){if(a>b){a=b;}} template void maxeq(T& a,U b){if(a void soun(T& ar) {sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());} int main(void){ int i,j,n,m;cin>>n>>m; array ans={0}; for(i=0;i0){yote[ans[j]+1]--;ans[j]++;} else{ans[j]=0;} } ans[i]=nko; } for(i=n-1;i>=0;i--){cout<