import sys





def solve():

    readline = sys.stdin.buffer.readline

    mod = 10 ** 9 + 7

    a, b, k = list(map(int, readline().split()))

    res = []

    for i in range(a, min(a + k, b + 1)):

        if i not in res:

            res.append(i)

    for i in range(b, max(b - k, a - 1), -1):

        if i not in res:

            res.append(i)

    res.sort()

    print(*res, sep="\n")





if __name__ == '__main__':

    solve()

import sys





def solve():

    readline = sys.stdin.buffer.readline

    mod = 10 ** 9 + 7

    a, b, k = list(map(int, readline().split()))

    res = []

    for i in range(a, min(a + k, b + 1)):

        res.append(i)

    for i in range(b, max(b - k, a - 1), -1):

        if i not in res:

            res.append(i)

    print(*sorted(res), sep="\n")





if __name__ == '__main__':

    solve()

import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10**9 + 7
    a, b, k = list(map(int, readline().split()))
    res = []
    for i in range(a, min(a + k, b + 1)):
        if i not in res:
            res.append(i)
    for i in range(b, max(b - k, a - 1), -1):
        if i not in res:
            res.append(i)
    res.sort()
    print(*res, sep="\n")


if __name__ == "__main__":
    solve()

import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10**9 + 7
    a, b, k = list(map(int, readline().split()))
    res = []
    for i in range(a, min(a + k, b + 1)):
        res.append(i)
    for i in range(b, max(b - k, a - 1), -1):
        if i not in res:
            res.append(i)
    print(*sorted(res), sep="\n")


if __name__ == "__main__":
    solve()

-        if i not in res: -            res.append(i) +        res.append(i) -    res.sort() -    print(*res, sep="\n") +    print(*sorted(res), sep="\n")