#include <bits/stdc++.h>
using namespace std;

int f(int a, int b, int c, int d) {
    int s = a + b + c + d;
    return (s * s + a * a + b * b + c * c + d * d) / 2;
}

int count(int a, int b, int c, int d) {
    int same = (a == b) + (b == c) + (c == d);
    switch(same) {
    case 0:
        return 24;
    case 1:
        return 12;
    case 2:
        return b == c ? 4 : 6;
    case 3:
        return 1;
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> ans(n + 1);
    for (int a = 0; a <= m; a++) {
        for (int b = a; b <= m; b++) {
            if (f(a, b, 0, 0) > n) break;
            for (int c = b; c <= m; c++) {
                if (f(a, b, c, 0) > n) break;
                for (int d = c; d <= m; d++) {
                    if (f(a, b, c, d) > n) break;
                    ans[f(a, b, c, d)] += count(a, b, c, d);
                }
            }
        }
    }
    for (int i = 0; i <= n; i++) {
        cout << ans[i] << "\n";
    }
}