MOD = 10**9 + 7

def multiply(a, b, mod):
    n = len(a)
    result = [[0]*n for _ in range(n)]
    for i in range(n):
        for k in range(n):
            if a[i][k] == 0:
                continue
            for j in range(n):
                result[i][j] = (result[i][j] + a[i][k] * b[k][j]) % mod
    return result

def matrix_power(mat, power, mod):
    n = len(mat)
    result = [[0]*n for _ in range(n)]
    # Identity matrix
    for i in range(n):
        result[i][i] = 1
    current = [row[:] for row in mat]
    while power > 0:
        if power % 2 == 1:
            result = multiply(result, current, mod)
        current = multiply(current, current, mod)
        power //= 2
    return result

def main():
    N, K, L = map(int, input().split())
    matrix = [[0] * N for _ in range(N)]
    for i in range(N):
        for j in range(N):
            d = (j - i) % N
            if d == 0:
                count = L // N
            else:
                if d > L:
                    count = 0
                else:
                    count = (L - d) // N + 1
            matrix[i][j] = count % MOD
    # Compute matrix^K
    mat_k = matrix_power(matrix, K, MOD)
    # The answer is the first row of mat_k (since we start at 0)
    for j in range(N):
        print(mat_k[0][j] % MOD)

if __name__ == "__main__":
    main()