Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for m in range(n):
    count = 0
    for i in range(n):
        x = i + 1
        xx = x * x
        if  x * x >= m+1:
            break
        for j in range(n):
            y = j + 1
            yy = y * y
            if xx + yy + x * y>= m+1:
                break
            for k in range(n):
                z = k + 1
                zz = z * z
                if xx + yy + zz + x * y + y * z + z * x > m+1:
                    break
                elif xx + yy + zz + x * y + y * z + z * x == m+1:
                    count += 1
                    break
    print(count)



Fixed submission:
n = int(input())
ans = [0] * n
count = 0
for i in range(n):
    x = i + 1
    xx = x * x
    if  x * x >= n:
        break
    for j in range(n):
        y = j + 1
        yy = y * y
        if xx + yy + x * y>= n:
            break
        for k in range(n):
            z = k + 1
            zz = z * z
            kotae = xx + yy + zz + x * y + y * z + z * x
            if kotae > n:
                break
            ans[kotae-1] += 1
for i in range(n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for m in range(n):
    count = 0
    for i in range(n):
        x = i + 1
        xx = x * x
        if  x * x >= n:
            break
        for j in range(n):
            y = j + 1
            yy = y * y
            if xx + yy + x * y>= n:
                break
            for k in range(n):
                z = k + 1
                zz = z * z
                if xx + yy + zz + x * y + y * z + z * x > m+1:
                    break
                elif xx + yy + zz + x * y + y * z + z * x == m+1:
                    count += 1
                    break
    print(count)



Fixed submission:
n = int(input())
ans = [0] * n
count = 0
for i in range(n):
    x = i + 1
    xx = x * x
    if  x * x >= n:
        break
    for j in range(n):
        y = j + 1
        yy = y * y
        if xx + yy + x * y>= n:
            break
        for k in range(n):
            z = k + 1
            zz = z * z
            kotae = xx + yy + zz + x * y + y * z + z * x
            if kotae > n:
                break
            ans[kotae-1] += 1
for i in range(n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for m in range(n):
    count = 0
    for i in range(n):
        x = i + 1
        xx = x * x
        if  x * x >= n:
            break
        for j in range(n):
            y = j + 1
            yy = y * y
            if xx + yy >= n:
                break
            for k in range(n):
                z = k + 1
                zz = z * z
                if xx + yy + zz + x * y + y * z + z * x > m+1:
                    break
                elif xx + yy + zz + x * y + y * z + z * x == m+1:
                    count += 1
                    break
    print(count)



Fixed submission:
n = int(input())
ans = [0] * n
count = 0
for i in range(n):
    x = i + 1
    xx = x * x
    if  x * x >= n:
        break
    for j in range(n):
        y = j + 1
        yy = y * y
        if xx + yy + x * y>= n:
            break
        for k in range(n):
            z = k + 1
            zz = z * z
            kotae = xx + yy + zz + x * y + y * z + z * x
            if kotae > n:
                break
            ans[kotae-1] += 1
for i in range(n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for m in range(n):
    count = 0
    for i in range(n):
        x = i + 1
        if x * x >= n:
            break
        for j in range(n):
            y = j + 1
            if x * x + y * y >= n:
                break
            for k in range(n):
                z = k + 1
                if x * x + y * y + z * z + x * y + y * z + z * x > m+1:
                    break
                elif x * x + y * y + z * z + x * y + y * z + z * x == m+1:
                    count += 1
                    break
    print(count)



Fixed submission:
n = int(input())
ans = [0] * n
count = 0
for i in range(n):
    x = i + 1
    xx = x * x
    if  x * x >= n:
        break
    for j in range(n):
        y = j + 1
        yy = y * y
        if xx + yy + x * y>= n:
            break
        for k in range(n):
            z = k + 1
            zz = z * z
            kotae = xx + yy + zz + x * y + y * z + z * x
            if kotae > n:
                break
            ans[kotae-1] += 1
for i in range(n):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for m in range(n):
    count = 0
    for i in range(n):
        x = i + 1
        if x * x >= n:
            break
        for j in range(n):
            y = j + 1
            if x * x + y * y >= n:
                break
            for k in range(n):
                z = k + 1
                if x * x + y * y + z * z + x * y + y * z + z * x == m+1:
                    count += 1
    print(count)



Fixed submission:
n = int(input())
ans = [0] * n
count = 0
for i in range(n):
    x = i + 1
    xx = x * x
    if  x * x >= n:
        break
    for j in range(n):
        y = j + 1
        yy = y * y
        if xx + yy + x * y>= n:
            break
        for k in range(n):
            z = k + 1
            zz = z * z
            kotae = xx + yy + zz + x * y + y * z + z * x
            if kotae > n:
                break
            ans[kotae-1] += 1
for i in range(n):
    print(ans[i])