#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using P = pair; constexpr int INF = 1001001001; constexpr int mod = 1000000007; // constexpr int mod = 998244353; template inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; auto calc = [&](int a, int b, int c, int d){ if(a == b){ if(b == c){ if(c == d) return 1; else return 4; } else{ if(c == d) return 6; else return 12; } } else{ if(b == c){ if(c == d) return 4; else return 12; } else{ if(c == d) return 12; else return 24; } } }; vector ans(n + 1); for(int a = 0; a <= m; ++a){ int s = a * a; for(int b = a; b <= m && s + (a + b) * b <= n; ++b){ s += (a + b) * b; for(int c = b; c <= m && s + (a + b + c) * c <= n; ++c){ s += (a + b + c) * c; for(int d = c; d <= m && s + (a + b + c + d) * d <= n; ++d){ ans[s + (a + b + c + d) * d] += calc(a, b, c, d); } s -= (a + b + c) * c; } s -= (a + b) * b; } } for(auto x : ans) cout << x << '\n'; return 0; }