#include using namespace std; const long long MOD=1000000007; // const long long MOD=998244353; #define LOCAL #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(),(x).end() const int INF=1e9; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template istream &operator>>(istream &is,vector &v){ for (T &x:v) is >> x; return is; } template ostream &operator<<(ostream &os,const vector &v){ for (int i=0;i ostream &operator<<(ostream &os,const pair &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template ostream&operator<<(ostream &os,const tuple &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template ostream&operator<<(ostream &os,const tuple &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template ostream &operator<<(ostream &os,const map &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template ostream &operator<<(ostream &os,const unordered_map &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template ostream &operator<<(ostream &os,const set &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template ostream &operator<<(ostream &os,const multiset &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template ostream &operator<<(ostream &os,const unordered_set &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template ostream &operator<<(ostream &os,const deque &v){ for (int i=0;i void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template T lcm(T x,T y){return x/gcd(x,y)*y;} template inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template inline bool chmax(T1 &a,T2 b){ if (a roots={{0,0},{1,0}}; vector rev={0,1}; int base=1; void ensure_base(int nbase){ if (nbase<=base) return; rev.resize(1<>1]>>1)|((i&1)<<(nbase-1)); } roots.resize(1< &a,int n){ int zeros=__builtin_ctz(n); ensure_base(zeros); int shift=base-zeros; for (int i=0;i>shift)){ swap(a[i],a[rev[i]>>shift]); } } for (int k=1;k multiply(const vector &a,const vector &b){ int need=a.size()+b.size()-1; int nbase=1; while((1< C(sz); for (int i=0;i>1)),s(0,1),t(0.5,0); for (int i=0;i<=(sz>>1);++i){ int j=(sz-i)&(sz-1); Complex z=(C[j]*C[j]-(C[i]*C[i]).conj())*r; C[j]=(C[i]*C[i]-(C[j]*C[j]).conj())*r; C[i]=z; } for (int i=0;i<(sz>>1);++i){ Complex C0=(C[i]+C[i+(sz>>1)])*t; Complex C1=(C[i]-C[i+(sz>>1)])*t*roots[(sz>>1)+i]; C[i]=C0+C1*s; } fft(C,sz>>1); vector res(need); for (int i=0;i>1].y:C[i>>1].x); } return res; } } int main(){ cin.tie(0); ios::sync_with_stdio(false); int N,M; cin >> N >> M; vector> cnt(3*M+1,vector(N+1,0)); for (int i=0;i<=M;++i){ for (int j=0;j<=M;++j){ for (int k=0;k<=M;++k){ int sum=i*i+i*j+i*k+j*j+j*k+k*k; if (sum<=N) ++cnt[i+j+k][sum]; } } } vector ans(N+1,0); for (int i=0;i<=3*M;++i){ vector other(N+1,0); for (int j=0;j<=M&&j*j+j*i<=N;++j) ++other[j*j+j*i]; vector res=FastFourierTransform::multiply(cnt[i],other); for (int i=0;i<=N;++i) ans[i]+=res[i]; } for (int i=0;i<=N;++i) cout << ans[i] << '\n'; }