import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] result = new int[n + 1];
        for (int a = 0; a <= m && (a * a) * 8 <= n; a++) {
            for (int b = a; b <= m && a * a + a * b * 3 + b * b * 4 <= n; b++) {
                for (int c = b; c <= m && a * a + a * b + a * c * 2 + b * c * 2 + c * c * 2 <= n; c++) {
                    for (int d = c; d <= m && a * a + a * b + a * c + a * d + b * b + b * c + b * d + c * c + c * d + d * d <= n; d++) {
                        int idx = a * a + a * b + a * c + a * d + b * b + b * c + b * d + c * c + c * d + d * d;
                        int ans = 0;
                        if (a == b) {
                            if (b == c) {
                                if (c == d) {
                                    ans++;
                                } else {
                                    ans += 4;
                                }
                            } else {
                                if (c == d) {
                                    ans += 6;
                                } else {
                                    ans += 12;
                                }
                            }
                        } else if (b == c) {
                            if (c == d) {
                                ans += 4;
                            } else {
                                ans += 12;
                            }
                        } else if (c == d) {
                            ans += 12;
                        } else {
                            ans += 24;
                        }
                        result[idx] += ans;
                    }
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int x : result) {
            sb.append(x).append("\n");
        }
        System.out.print(sb);
    }
}
class BinaryIndexedTree {
    int size;
    int[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new int[size];
    }
    
    public void add(int idx, int value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public int getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public int getSum(int x) {
        int mask = 1;
        int ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}