import math


def solve():
    n, k, p = map(int, input().strip().split())
    l, r = 1, k
    while l < r:
        m = (l + r) // 2
        if (m * p) > n:
            r = m
        else:
            l = m + 1
    divisors = set()
    for i in range(1, int(math.sqrt(n)) + 2):
        if n % i == 0:
            divisors.add(i)
            divisors.add(n // i)
    ans = []
    for i in divisors:
        if i >= l and i <= min(n, k):
            ans.append(i)
    print(len(ans))
    for i in ans:
        print(i, end=" ")


if __name__ == "__main__":
    t = 1
    for i in range(t):
        solve()