#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

ll f(ll a, ll b, ll c, ll d){
    return a*(a+b+c+d)+b*(b+c+d)+c*(c+d)+d*d;
}

int main(){
    ll N, M;
    cin >> N >> M;
    vector<ll> fac = {1, 1, 2, 6, 24};

    vector<ll> ans(N+1, 0);

    rep2(i, 0, M) rep2(j, i+1, M) rep2(k, j+1, M) rep2(l, k+1, M){
        ll x = f(i, j, k, l);
        if(x > N) break;
        ans[x] += 24;
    }

    rep2(i, 0, M) rep2(j, i+1, M) rep2(k, j+1, M){
        ll x = f(i, i, j, k), y = f(i, j, j, k), z = f(i, j, k, k);
        if(x > N) break;
        ans[x] += 12;
        if(y <= N) ans[y] += 12;
        if(z <= N) ans[z] += 12;
    }

    rep2(i, 0, M) rep2(j, i+1, M){
        ll x = f(i, i, i, j), y = f(i, i, j, j), z = f(i, j, j, j);
        if(x > N) break;
        ans[x] += 4;
        if(y <= N) ans[y] += 6;
        if(z <= N) ans[z] += 4;
    }

    rep2(i, 0, M){
        ll x = f(i, i, i, i);
        if(x > N) break;
        ans[x] += 1;
    }

    rep(i, N+1) cout << ans[i] << '\n';
}