#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
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;

    vector<int> fact(5, 1);
    for(int i = 1; i <= 4; ++i) fact[i] = fact[i - 1] * i;

    vector<ll> ans(n + 1);
    vector<int> nums, cnt;
    for(int a = 0; a <= m; ++a){
        ll s = a * a;
        nums.emplace_back(a);
        cnt.emplace_back(1);

        for(int b = a; b <= m && s + (a + b) * b <= n; ++b){
            s += (a + b) * b;
            if(b == nums.back()) cnt.back() += 1;
            else{
                nums.emplace_back(b);
                cnt.emplace_back(1);
            }

            for(int c = b; c <= m && s + (a + b + c) * c <= n; ++c){
                s += (a + b + c) * c;
                if(c == nums.back()) cnt.back() += 1;
                else{
                    nums.emplace_back(c);
                    cnt.emplace_back(1);
                }

                for(int d = c; d <= m && s + (a + b + c + d) * d <= n; ++d){
                    if(d == nums.back()) cnt.back() += 1;
                    else{
                        nums.emplace_back(d);
                        cnt.emplace_back(1);
                    }

                    int weight = fact[4];
                    for(int c : cnt) weight /= fact[c];
                    ans[s + (a + b + c + d) * d] += weight;

                    if(cnt.back() > 1) cnt.back() -= 1;
                    else{
                        nums.pop_back();
                        cnt.pop_back();
                    }
                }

                s -= (a + b + c) * c;
                if(cnt.back() > 1) cnt.back() -= 1;
                else{
                    nums.pop_back();
                    cnt.pop_back();
                }
            }

            s -= (a + b) * b;
            if(cnt.back() > 1) cnt.back() -= 1;
            else{
                nums.pop_back();
                cnt.pop_back();
            }
        }

        nums.pop_back();
        cnt.pop_back();
    }

    for(auto x : ans)   cout << x << '\n';

    return 0;
}