#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	
	vector<int> ans(N + 1);
	REP(i, M + 1) FOR(j, i + 1, M + 1) {
		if ((i + j + j + j) * (i + j + j + j) + i * i + 3 * j * j > 2 * N) break;
		FOR(k, j + 1, M + 1) {
			if ((i + j + k + k) * (i + j + k + k) + i * i + j * j + 2 * k * k > 2 * N) break;
			FOR(l, k + 1, M + 1) {
				const int s = (i + j + k + l) * (i + j + k + l) + i * i + j * j + k * k + l * l;
				if (~s & 1 && s <= 2 * N) ans[s >> 1] += 24;
			}
		}
	}
	
	REP(i, M + 1) FOR(j, i + 1, M + 1) FOR(k, j + 1, M + 1) {
		{
			const int s = (i + i + j + k) * (i + i + j + k) + 2 * i * i + j * j + k * k;
			if (~s & 1 && s <= 2 * N) ans[s >> 1] += 12;
		}
		{
			const int s = (i + j + j + k) * (i + j + j + k) + 2 * j * j + i * i + k * k;
			if (~s & 1 && s <= 2 * N) ans[s >> 1] += 12;
		}
		{
			const int s = (i + j + k + k) * (i + j + k + k) + 2 * k * k + i * i + j * j;
			if (~s & 1 && s <= 2 * N) ans[s >> 1] += 12;
		}
	}
	
	REP(i, M + 1) FOR(j, i + 1, M + 1) {
		{
			const int s = (i + i + j + j) * (i + i + j + j) + 2 * (i * i + j * j);
			if (~s & 1 && s <= 2 * N) ans[s >> 1] += 6;
		}
		{
			const int s = (i + i + i + j) * (i + i + i + j) + 3 * i * i + j * j;
			if (~s & 1 && s <= 2 * N) ans[s >> 1] += 4;
		}
		{
			const int s = (i + j + j + j) * (i + j + j + j) + 3 * j * j + i * i;
			if (~s & 1 && s <= 2 * N) ans[s >> 1] += 4;
		}
	}
	
	REP(i, M + 1) {
		const int s = 16 * i * i + 4 * i * i;
		if (~s & 1 && s <= 2 * N) ++ans[s >> 1];
	}
	
	
	
	REP(i, N + 1) printf("%d\n", ans[i]);
}