#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

int sq(int x){ return x*x; }

int calc(int a, int b, int c, int d){
    return (sq(a+b+c+d)+sq(a)+sq(b)+sq(c)+sq(d))/2;
}

ll f[8] = {1, 4, 6, 12, 4, 12, 12, 24};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<int> ans(n+1);
    int cnt_all = 0;
    for(int a = 0; a <= m; a++){
        for(int b = a; b <= m; b++){
            if(calc(a, b, 0, 0) > n) break;
            for(int c = b; c <= m; c++){
                if(calc(a, b, c, 0) > n) break;
                for(int d = c; d <= m; d++){
                    int x = calc(a, b, c, d);
                    // cout << x << ' ';
                    if(x > n) break;
                    int s = 0;
                    if(a != b) s += 1;
                    if(b != c) s += 2;
                    if(c != d) s += 4;
                    ans[x] += f[s];
                }
            }
        }
    }
    cout << cnt_all << endl;
    for(int x: ans) cout << x << endl;
}