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

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        long[] ans = new long[n + 1];
        for (int a = 0; a <= m && a * a * 10 <= n; a++) {
            for (int b = a; b <= m && a * a + a * b * 3 + b * b * 6 <= n; b++) {
                for (int c = b; c <= m && a * a + a * b + a * c * 2 + b * c * 2 + c * c * 4 <= 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;
                        ans[idx] += getCount(a, b, c, d);
                    }
                }
            }
        }
        System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));
    }
    
    static int getCount(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;
                }
            }
        }
    }
}

class BinaryIndexedTree {
    static final int MOD = 998244353;
    int size;
    long[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new long[size];
    }
    
    public void add(int idx, long value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                tree[idx] %= MOD;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public long getSum(int from, int to) {
        return (getSum(to) - getSum(from - 1) + MOD) % MOD;
    }
    
    public long getSum(int x) {
        int mask = 1;
        long ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                ans %= MOD;
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    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 int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}