Print all the integers that satisfies the following in ascending order:
 - Among the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.

-----Constraints-----
 - 1 \leq A \leq B \leq 10^9
 - 1 \leq K \leq 100
 - All values in input are integers.

-----Input-----
Input is given from Standard Input in the following format:
A B K

-----Output-----
Print all the integers that satisfies the condition above in ascending order.

-----Sample Input-----
3 8 2

-----Sample Output-----
3
4
7
8

 - 3 is the first smallest integer among the integers between 3 and 8.
 - 4 is the second smallest integer among the integers between 3 and 8.
 - 7 is the second largest integer among the integers between 3 and 8.
 - 8 is the first largest integer among the integers between 3 and 8.
[{"code": "a, b, k = map(int,input().split())\nfor i in range(a,min(b,a+k-1)+1):\n    print(i)\nfor i in range(max(b-k+1,a+k),b+1):\n    print(i)", "passed": true, "time": 0.2, "memory": 14132.0, "status": "done"}, {"code": "import sys\nlines = [s.rstrip(\"\\n\") for s in sys.stdin.readlines()]\na, b, k = [int(num) for num in lines.pop(0).split(\" \")]\ns1 = set(range(a, min(b, a + k)))\ns2 = set(range(max(a, b - k + 1), b + 1))\nlis = sorted(s1 | s2)\nfor i in lis:\n    print(i)\n", "passed": true, "time": 0.21, "memory": 14104.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nans = set()\nr = range(a, b + 1)\nfor i in range(min(k, len(r))):\n    ans.add(r[i])\n    ans.add(r[-i-1])\nelse:\n    [print(i) for i in sorted(ans)]", "passed": true, "time": 0.3, "memory": 14096.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nnum_limit = b-a+1\nif num_limit <= k*2:\n    ans_list = [i for i in range(a, b+1, 1)]\nelse:\n    ans_list = []\n    for j in range(k):\n        low = a+j\n        high = b-j\n        ans_list.append(low)\n        ans_list.append(high)\n    ans_list.sort()\n\nfor l in ans_list:\n    print(l)", "passed": true, "time": 1.64, "memory": 14332.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nif b-a < k:\n  k = b-a\nif k == 0:\n  k = 1\n  \nans = []\nfor i in range(a, a+k):\n    ans.append(i)\nfor j in range(b, b-k, -1):\n    ans.append(j)\n    \nans = sorted(set(ans))\nfor i in ans:\n  print(i)", "passed": true, "time": 0.3, "memory": 14340.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nr=range(a,b+1)\nfor i in sorted(set(r[:k])|set(r[-k:])):print(i)", "passed": true, "time": 0.4, "memory": 14228.0, "status": "done"}, {"code": "# ABC093\nA, B, K = map(int, input().split())\n\nfor num in range(A, min(B+1, A+K)):\n    print(num)\nfor num in range(max(A+K, B-K+1), B+1):\n    print(num)", "passed": true, "time": 0.42, "memory": 14232.0, "status": "done"}, {"code": "A,B,K=map(int,input().split())\na=range(A,B+1)\nfor i in sorted(set(a[:K])|set(a[-K:])):\n    print(i)", "passed": true, "time": 0.14, "memory": 14308.0, "status": "done"}, {"code": "A,B,K=map(int, input().split())\n\nif K>(B-A)/2:\n    for i in range(A,B+1):\n        print(i)\nelse:\n    for i in range(A,A+K):\n        print(i)\n    for i in range(B-K+1,B+1):\n        print(i)", "passed": true, "time": 0.23, "memory": 14072.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nx = [i for i in range(a, min(a + k, b + 1))]\ny = [i for i in range(max(a, b - k + 1), b + 1)]\nfor i in sorted(set(x + y)):\n  print(i)", "passed": true, "time": 0.23, "memory": 14272.0, "status": "done"}, {"code": "a,b,k = map(int, input().split())\nfor i in range(a, a+k):\n    if b < i:\n        break\n    print(i)\nfor i in range(max(a+k,b-k+1), b+1):\n    if i < a:\n        continue\n    print(i)", "passed": true, "time": 0.33, "memory": 14204.0, "status": "done"}, {"code": "a,b,k = list(map(int, input().split()))\nans = []\nfor i in range(k):\n    n = a + i\n    if n > b:\n        break\n    ans.append(n)\n\nst = b - k + 1\nst = max(st, ans[-1]+1)\nfor i in range(st, b+1):\n    ans.append(i)\n\nprint(*ans, sep='\\n')", "passed": true, "time": 0.14, "memory": 14204.0, "status": "done"}, {"code": "A,B,K=map(int,input().split())\nC=A\nif K>=B-A:\n    for f in range(1+B-A):\n        print(C)\n        C+=1\nelse:\n    B-=(K-1)\n    for i in range(K):\n        print(A)\n        A+=1\n        if A==B:\n            break\n    for j in range(K):\n        print(B)\n        B+=1", "passed": true, "time": 0.14, "memory": 14316.0, "status": "done"}, {"code": "lst = input().split()\nA = int(lst[0])\nB = int(lst[1])\nK = int(lst[2])\n\nif (B - A + 1) <= 2 * K:\n   for n in list(range(A, B+1)):\n      print(n)\nelse:\n   for n in list(range(A, A+K)):\n      print(n)\n   for n in list(range(B-K+1, B+1)):\n      print(n)", "passed": true, "time": 0.24, "memory": 14336.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\n\nif k>=b-a+1:\n  for i in range(a,b+1):\n    print(i)\n\nelse:\n  a_set={i for i in range(a,a+k)}\n  b_set={i for i in range(b-k+1,b+1)}\n\n  ans_set = sorted(a_set | b_set)\n\n  for i in ans_set:\n    print(i)", "passed": true, "time": 0.14, "memory": 14040.0, "status": "done"}, {"code": "A, B, K = map(int, input().split())\n\nans = []\n\nfor i in range(K):\n  if A + i <= B and A + i not in ans:\n    ans.append(A + i)\n  \n  if B - i >= A and B - i not in ans:\n    ans.append(B - i)\n    \nans.sort()\n\nfor i in ans:\n  print(i)", "passed": true, "time": 0.15, "memory": 14104.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nr = range(a, b + 1)\nr = list(set(r[:k]) | set(r[-k:]))\nr.sort()\n\nfor _r in r:\n    print(_r)", "passed": true, "time": 0.14, "memory": 14152.0, "status": "done"}, {"code": "A, B, K = list(map(int, input().split()))\n\nfor i in range(A, min(A+K, B+1)):\n    print(i)\nfor i in range(max(A+K, B-K+1), B+1):\n    print(i)\n", "passed": true, "time": 0.14, "memory": 14040.0, "status": "done"}, {"code": "a,b,k = map(int, input().split())\nl = [i for i in range(a,min(b,a+k))]\nl = l + [i for i in range(max(a,b-k+1),b+1)]\nl = list(set(l))\nl.sort()\nfor i in l:\n    print(i)", "passed": true, "time": 0.23, "memory": 14212.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nif b-a>=k*2-1:\n    for i in range(k):\n        print(a+i)\n    for i in range(k):\n        print(b+1-(k-i))\nelse:\n    for j in range(a,b+1):\n        print(j)", "passed": true, "time": 0.15, "memory": 14336.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nX = range(a, b+1)\nY = sorted(list(set(X[:k]) | set(X[-k:])))\nprint(*Y, sep='\\n')", "passed": true, "time": 0.14, "memory": 14264.0, "status": "done"}, {"code": "a,b,n=map(int,input().split())\nAlist = list(range(a,min(a+n,b+1),1))\nBlist = list(range(max(a,b-n+1),b+1,1))\nC = sorted(set(Alist)|set(Blist))\nfor i in list(C):\n  print(i)", "passed": true, "time": 0.14, "memory": 14092.0, "status": "done"}, {"code": "A,B,K = map(int,input().split())\nif K >= (B - A + 1)/2:\n    for i in range(A,B+1):\n        print(i)\nelse:\n    for i in range(A,A+K):\n        print(i)\n    for i in range(B -K +1,B+1):\n        print(i)", "passed": true, "time": 0.22, "memory": 14216.0, "status": "done"}, {"code": "A,B,K=list(map(int,input().split()))\n\nif B-A+1>2*K:\n    for i in range(K):\n        print((A+i))\n    for j in range(K):\n        print((B-K+j+1))\nelse:\n    for k in range(B-A+1):\n        print((A+k))\n", "passed": true, "time": 0.14, "memory": 14136.0, "status": "done"}, {"code": "a,b,k=list(map(int,input().split()))\n\nans=[]\n\nfor i in range(k):\n    if a+i<=b-i:\n        ans.append(a+i)\n        ans.append(b-i)\n\nans=set(ans)\nans=list(ans)\nans.sort()\n\n\nfor a in ans:\n    print(a)\n\n", "passed": true, "time": 0.14, "memory": 14224.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nx = list()\nfor i in range(k):\n    if a+i<= b:\n        print(a+i)\n        x.append(a+i)\nfor j in range(k):\n    f = b-k+j+1\n    if a <= f and f <= b and f not in x:\n        print(f)", "passed": true, "time": 0.14, "memory": 14284.0, "status": "done"}, {"code": "A, B, K = map(int, input().split())\n\nL = []\ns = [i for i in range(A, min(A+K, B+1))]\nl = [j for j in range(B, max(A-1, B-K), -1)]\nL += s + l\nL = list(set(L))\nL.sort()\n\nfor i in L:\n    print(i)", "passed": true, "time": 0.15, "memory": 14264.0, "status": "done"}, {"code": "A,B,K = map(int,input().split())\n\nfor i in range(A,min(A+K,B+1)):\n    print(i)\n    \nfor i in range(max(A+K,B-K+1),B+1):\n    print(i)", "passed": true, "time": 0.14, "memory": 14144.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nif b - a < 2 * k:\n    for i in range(a, b + 1):\n        print(i)\nelse:\n    for i in range(a, a + k):\n        print(i)\n    for i in range(b - k + 1, b + 1):\n        print(i)", "passed": true, "time": 0.15, "memory": 14244.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nif b-a <= k:\n  for i in range(a, b+1):\n    print(i)\nelse:\n  ans = []\n  for i in range(a, a+k):\n    if i not in ans:\n      ans.append(i)\n      print(i)\n  for j in range(b-k+1, b+1):\n    if j not in ans:\n      print(j)", "passed": true, "time": 0.14, "memory": 14276.0, "status": "done"}, {"code": "#B - Small and Large Integers\nA,B,K = map(int,input().split())\n\nans = []\nfor j in range(K):\n    a = A+j\n    b = B-j\n    if a > B or b < A:\n        break\n    ans.append(a)\n    ans.append(b)\n\nans = list(sorted(set(ans), reverse = False))\n\nfor i in ans:\n    print(i)", "passed": true, "time": 0.14, "memory": 14224.0, "status": "done"}, {"code": "a,b,k=list(map(int,input().split()))\nans=[]\nfor i in range(a,k+a):\n  if a<=i<=b:\n    ans.append(i)\n    \nfor i in range(b-k+1,b+1):\n  if a<=i<=b:\n    ans.append(i)\nans=list(set(ans))\nans.sort()\nfor i in ans:\n  print(i)\n\n", "passed": true, "time": 0.14, "memory": 14340.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nans=set()\nfor i in range(k):\n  ans.add(a+i)\n  ans.add(b-i)\nfor i in sorted(list(ans)):\n  if a<=i<=b:\n    print(i)", "passed": true, "time": 0.15, "memory": 14084.0, "status": "done"}, {"code": "A,B,K=map(int,input().split())\nif B-A<=2*(K-1):\n    for i in range(A,B+1):\n        print(i)\nelse:\n    for i in range(A,A+K):\n        print(i)\n    for j in range(B-K+1,B+1):\n        print(j)", "passed": true, "time": 0.36, "memory": 14232.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\nans = set([])\nfor i in range(a,min(a+k,b)):\n    ans.add(i)\nfor i in range(max(b-k+1,a),b+1):\n    ans.add(i)\nans = list(ans)\nans.sort()\nfor i in ans:\n    print(i)", "passed": true, "time": 0.35, "memory": 14148.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\n\ncnt=int(b-a+1)\n\nif cnt<=2*k:\n    for i in range(a,b+1):\n        print(i)\nelse:\n    for i in range(a,a+k):\n        print(i)\n    for i in range(b-k+1,b+1):\n        print(i)", "passed": true, "time": 0.15, "memory": 14112.0, "status": "done"}, {"code": "#!/usr/bin/env python3\n\na, b, k = list(map(int, input().split()))\n\nans = set([])\n\nfor i in range(a, min(a+k, b)):\n    ans.add(i)\n\nfor i in range(max(a, b-k+1), b+1):\n    ans.add(i)\n\nfor i in sorted(list(ans)):\n    print(i)\n", "passed": true, "time": 0.27, "memory": 14324.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\n\nif (b - a + 1) >= 2*k:\n    for i in range(a,a+k):\n        print(i)\n    for j in range(b-k+1,b+1):\n        print(j)\n    \nelse:\n    for i in range(a,b+1):\n        print(i)", "passed": true, "time": 0.3, "memory": 14052.0, "status": "done"}, {"code": "A,B,K=list(map(int,input().split()))\nif A+K-1>=B-K+1:\n    for i in range(A,B+1):\n        print(i)\nelse:\n    for i in range(A,A+K):\n        print(i)\n    for i in range(B-K+1,B+1):\n        print(i)\n", "passed": true, "time": 0.18, "memory": 14272.0, "status": "done"}, {"code": "a,b,k = map(int, input().split())\nsetA = set(i for i in range(a,min(a+k,b+1)))\nsetB = set(j for j in range(b,max(b-k,a-1),-1))\nl = list(setA|setB)\nl.sort()\nfor m in l:\n  print(m)", "passed": true, "time": 0.14, "memory": 14104.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\nif (b-a+1) >= (2*k):\n  for i in range(k):\n    print(a+i)\n  for i in reversed(range(0,k)):\n    print(b-i)\nelse:\n  for i in range(a,b+1):\n    print(i)", "passed": true, "time": 0.14, "memory": 14128.0, "status": "done"}, {"code": "import sys\n\n\nstdin = sys.stdin\ndef ns(): return stdin.readline().rstrip()\ndef ni(): return int(stdin.readline().rstrip())\ndef nm(): return list(map(int, stdin.readline().split()))\ndef nl(): return list(map(int, stdin.readline().split()))\n\n\ndef main():\n    a, b, k = nm()\n\n    for i in range(a, min(a + k, b + 1)):\n        print(i)\n    for i in range(max(a + k, b - k + 1), b + 1):\n        print(i)\n\n\ndef __starting_point():\n    main()\n\n__starting_point()", "passed": true, "time": 0.21, "memory": 14040.0, "status": "done"}, {"code": "A, B, K = map(int, input().split())\n\nfor i in range(A, min(A + K, B + 1)):\n    print(i)\nfor i in range(max(B - K + 1, A + K), B + 1):\n    print(i)", "passed": true, "time": 0.14, "memory": 14224.0, "status": "done"}, {"code": "A, B, K = list(map(int, input().split()))\n\nupstart = max(B - K + 1, 0)\nuplim = min(upstart + K, B)\nans = set([a for a in range(A, min(A + K, B))] + [b for b in range(upstart, uplim + 1)])\nans = sorted(list(ans))\nfor a in ans:\n    if a < A:\n        continue\n    print(a)\n", "passed": true, "time": 0.14, "memory": 14080.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nif b-a+1<=2*k:\n  for i in range(a,b+1):\n    print(i)\nelse:\n  for i in range(a,a+k):\n    print(i)\n  for j in range(b-k+1,b+1):\n    print(j)", "passed": true, "time": 0.14, "memory": 14260.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\n\nif b-a <= k:\n  for i in range(a, b+1):\n    print(i)\nelse:\n  ans = []\n  for i in range(a, a+k):\n    if i not in ans:\n      ans.append(i)\n      print(i)\n  for j in range(b-k+1, b+1):\n    if j not in ans:\n      print(j)\n", "passed": true, "time": 0.27, "memory": 14148.0, "status": "done"}, {"code": "import sys\nsys.setrecursionlimit(10**9)\n\ndef mi(): return map(int,input().split())\ndef ii(): return int(input())\ndef isp(): return input().split()\ndef deb(text): print(\"-------\\n{}\\n-------\".format(text))\n\nINF=10**20\ndef main():\n    A,B,K=mi()\n    ans = set()\n    for i in range(A,A+K):\n        if A<=i<=B:\n            ans.add(i)\n    \n    for i in range(B-K+1,B+1):\n        if A<=i<=B:\n            ans.add(i)\n    \n    ans = list(ans)\n    ans.sort()\n    print(*ans,sep='\\n')\n\n\n\n\n\n\n\ndef __starting_point():\n    main()\n__starting_point()", "passed": true, "time": 0.23, "memory": 14308.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nx=[]\ny=[]\nif b-a<k:\n    k=b-a+1\nfor i in range(a,a+k):\n    x.append(i)\nfor i in range(b-k+1,b+1):\n    x.append(i)\nx=list(set(x))\nx.sort()\nfor i in range(len(x)):\n    print(x[i])", "passed": true, "time": 0.28, "memory": 14168.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\nif (b - a + 1) <= 2 * k:\n  for i in range(a, b + 1):\n    print(i)\nelse:\n  for i in range(a, a + k):\n    print(i)\n  for i in range(b - k + 1, b + 1):\n    print(i)\n", "passed": true, "time": 0.15, "memory": 14344.0, "status": "done"}, {"code": "from typing import List\n\n\ndef answer(a: int, b: int, k: int) -> List[int]:\n    a_k = set(range(a, min(a + k, b + 1)))\n    k_b = set(range(max(b - k + 1, a + 1), b + 1))\n\n    return sorted(a_k.union(k_b))\n\n\ndef main():\n    a, b, k = list(map(int, input().split()))\n    for i in answer(a, b, k):\n        print(i)\n\n\ndef __starting_point():\n    main()\n\n__starting_point()", "passed": true, "time": 0.15, "memory": 15584.0, "status": "done"}, {"code": "A, B, K = map(int, input().split())\nL = set()\nfor i in range(A, A+K):\n  if i <= B:\n    L.add(i)\nfor i in range(B, B-K, -1):\n  if i >= A:\n    L.add(i)\nprint(*sorted(list(L)), sep=\"\\n\")", "passed": true, "time": 0.14, "memory": 14140.0, "status": "done"}, {"code": "A, B, K = map(int, input().split())\n\nnum = []\nif A == B:\n    print(A)\nelif (B + 1 - A) / 2 <= K:\n    for i in range(A, B + 1):\n        print(i)\nelse:\n    for j in range(K):\n        num.append(A + j)\n        num.append(B - j)\n    for k in range(len(num)):\n        num.sort()\n        print(num[k])", "passed": true, "time": 0.22, "memory": 14140.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\n\nfor i in range(k):\n    x = a + i\n    if x <= b:\n        print(a + i)\n    \nfor i in range(k):\n    x = b - k + i + 1\n    if x <= a + k - 1 or x < a:\n        pass\n    else:\n        print(x)", "passed": true, "time": 0.14, "memory": 14112.0, "status": "done"}, {"code": "a,b,k=map(int, input().split())\nr=range(2)\nan=sorted(set(range(a,min(a+k,b+1)))|set(range(max(a,b-k+1),b+1)))\nfor i in an:\n    print(i)", "passed": true, "time": 0.14, "memory": 14232.0, "status": "done"}, {"code": "A,B,K = map(int, input().split())\nflag = True\n\nfor i in range(A,A+K):\n    print(i)\n    if i == B:\n        falg = False\n        break\n\nif flag:\n if A+(K-1) < B-(K-1):\n    for i in range(B-(K-1),B+1):\n        print(i)\n        if i == B:\n            break\n\n else:\n    for i in range(A+K,B+1):\n        print(i)\n        if i == B:\n            break", "passed": true, "time": 0.14, "memory": 14328.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\nfor i in range(a,min(b+1,a+k)):\n    print(i)\nfor j in range(max(b-k,a+k-1),b):\n    print(j+1)", "passed": true, "time": 0.14, "memory": 14300.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\nres = set()\nfor i in range(a, a + k):\n    res.add(min(b, i))\n\nfor i in range(b, b - k, -1):\n    res.add(max(a, i))\n\nres = sorted(list(res))\nfor i in range(len(res)):\n    print((res[i]))\n", "passed": true, "time": 0.14, "memory": 14220.0, "status": "done"}, {"code": "A,B,K = list(map(int,input().split()))\nif B - A >= 2 * K :\n  for i in range(K):\n    print((A + i))\n  for j in reversed(list(range(K))):\n    print((B - j))\nelse:\n  for _ in range(A,B + 1):\n    print(_)\n", "passed": true, "time": 0.14, "memory": 14136.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\nsmall = [i for i in range(a,a+k) if a <= i <= b]\nbig = [i for i in range(b-k+1,b+1) if a <= i <= b]\nfor i in range(len(small)):\n  if small[i] not in big:\n    big.append(small[i])\nbig.sort()\nfor i in range(len(big)):\n  print(big[i])", "passed": true, "time": 0.14, "memory": 14092.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nans = []\nfor i in range(k):\n  if a <= a+i <= b:\n    ans.append(a + i)\n  if a <= b-i <= b:\n    ans.append(b - i)\nans = list(set(ans))\nans.sort()\nfor i in range(len(ans)):\n  print(ans[i])", "passed": true, "time": 0.14, "memory": 14336.0, "status": "done"}, {"code": "A,B,K=map(int,input().split())\n\nx = range(A,B+1)\n\nfor s in sorted(set(x[:K]) | set(x[-K:])):\n\tprint(s)", "passed": true, "time": 0.27, "memory": 14204.0, "status": "done"}, {"code": "a,b,k=list(map(int, input().split()))\nk=min(k,b-a+1)\n*al,=list(range(a,a+k))\n*al2,=list(range(b-k+1,b+1))\nans=al+al2\nans=list(set(ans))\nans.sort()\nfor i in ans:print(i)\n\n", "passed": true, "time": 0.14, "memory": 14180.0, "status": "done"}, {"code": "a,b,k = list(map(int,input().split()))\nl = []\nfor i in range(a,min(b,a+k)):\n  l.append(i)\nfor i in range(max(b-k+1,a),b+1):\n  l.append(i)\nans = sorted(set(l))\nfor i in ans:\n  print(i)\n\n", "passed": true, "time": 0.16, "memory": 14104.0, "status": "done"}, {"code": "a,b,k=map(int, input().split())\n\nif b-a+1<=k*2:\n    for i in range(a,b+1):\n        print(i)\n    \nelse:\n    for j in range(a,a+k):\n        print(j)\n    \n    for p in range(b-k+1,b+1):\n        print(p)", "passed": true, "time": 0.35, "memory": 14260.0, "status": "done"}, {"code": "A, B, K = list(map(int, input().split()))\nSA = list(range(A, min(B, A + K)))\nSB = list(range(max(A, B - K + 1), B + 1))\n\nans = sorted(set(SA + SB))\nfor a in ans:\n    print(a)\n", "passed": true, "time": 0.15, "memory": 14244.0, "status": "done"}, {"code": "A, B, K = map(int, input().split())\n\nif K > (B - A) // 2:\n    for i in range(A, B + 1):\n        print(i)\nelse:\n    for i in range(A, A + K):\n        print(i)\n    for i in range(B - K + 1, B + 1):\n        print(i)", "passed": true, "time": 0.14, "memory": 14088.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\n\nif (b-a +1) <= 2 * k:\n  for i in range(a,b+1):\n    print(i)\nelse:\n  for i in range(a, a+k):\n    print(i)\n  for i in range(b-k+1, b+1):\n    print(i)", "passed": true, "time": 0.23, "memory": 14276.0, "status": "done"}, {"code": "a, b, k = (int(i) for i in input().split())\nlist_ans = []\nfor i in range(1, k + 1):\n    if a == b:\n        list_ans.append(a)\n        break\n    if a > b: break\n    list_ans.append(a)\n    list_ans.append(b)\n    a = a + 1\n    b = b - 1\n\nfor i in sorted(list_ans): print(i)", "passed": true, "time": 0.14, "memory": 14204.0, "status": "done"}, {"code": "A,B,K = map(int,input().split())\n\nif K*2 > B-A:\n  for i in range(A,B+1):\n    print(i)\n\nelse:\n  for i in range(A,A+K):\n    print(i)\n  for j in range(B-K+1,B+1):\n    print(j)", "passed": true, "time": 0.15, "memory": 14136.0, "status": "done"}, {"code": "def resolve():\n    a, b, k = map(int, input().split())\n    if a+k-1 >= b-k+1:\n        for i in range(a, b+1):\n            print(i)\n    else:\n        for i in range(a, a+k):\n            print(i)\n        for i in range(b-k+1, b+1):\n            print(i)\nresolve()", "passed": true, "time": 0.14, "memory": 14048.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\n\nk = k-1\ni = a\nwhile True:\n    print(i)\n    i += 1\n    if  i > a + k or i > b:\n        break\nif i < b-k:\n    i = b-k\nwhile i <= b:\n    print(i)\n    i += 1", "passed": true, "time": 0.14, "memory": 14280.0, "status": "done"}, {"code": "a,b,k = [int(x) for x in input().split()]\nres = []\nfor i in range(a,min(b,k+a-1) + 1):\n  res.append(i)\nfor i in range(max(b-k+1,a),b+1):\n  res.append(i)\nres = list(set(res))\nres.sort()\nfor i in range(len(res)):\n  print(res[i])", "passed": true, "time": 0.14, "memory": 14324.0, "status": "done"}, {"code": "a=input().split(' ')\nA=int(a[0])\nB=int(a[1])\nK=int(a[2])\nif B-A+1<=K*2:\n  for i in range(A,B+1):\n    print(i)\nelse:\n  for i in range(K):\n    print((A+i))\n  for i in range(K):\n    print((B-K+1+i))\n", "passed": true, "time": 0.14, "memory": 14084.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nans=[]\nnum_min=a+k\nnum_max=b-k+1\nif (b-a+1)>2*k:\n    for i in range(a,num_min):\n        ans.append(i)\n    for i in range(num_max,b+1):\n        ans.append(i)\nelse:\n    for i in range(a,b+1):\n        ans.append(i)\nans=sorted(set(ans))\nfor i in ans:\n    print(i)", "passed": true, "time": 0.14, "memory": 14092.0, "status": "done"}, {"code": "A, B, K = list(map(int, input().split()))\nS = sorted(list(set([i for i in range(A, min(A + K, B))] + [i for i in range(max(A, B - K + 1), B + 1)])))\nfor s in S:\n    print(s)\n", "passed": true, "time": 0.14, "memory": 14356.0, "status": "done"}, {"code": "a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nif (a+c-1)<(b-c+1):\n  for i in range(c):\n    print(a+i)\n  for i in range(c):\n    print(b-c+1+i)\nelse:\n  for i in range(a,b+1):\n    print(i)", "passed": true, "time": 0.14, "memory": 14216.0, "status": "done"}, {"code": "#\n# abc093 b\n#\nimport sys\nfrom io import StringIO\nimport unittest\n\n\nclass TestClass(unittest.TestCase):\n    def assertIO(self, input, output):\n        stdout, stdin = sys.stdout, sys.stdin\n        sys.stdout, sys.stdin = StringIO(), StringIO(input)\n        resolve()\n        sys.stdout.seek(0)\n        out = sys.stdout.read()[:-1]\n        sys.stdout, sys.stdin = stdout, stdin\n        self.assertEqual(out, output)\n\n    def test_\u5165\u529b\u4f8b_1(self):\n        input = \"\"\"3 8 2\"\"\"\n        output = \"\"\"3\n4\n7\n8\"\"\"\n        self.assertIO(input, output)\n\n    def test_\u5165\u529b\u4f8b_2(self):\n        input = \"\"\"4 8 3\"\"\"\n        output = \"\"\"4\n5\n6\n7\n8\"\"\"\n        self.assertIO(input, output)\n\n    def test_\u5165\u529b\u4f8b_3(self):\n        input = \"\"\"2 9 100\"\"\"\n        output = \"\"\"2\n3\n4\n5\n6\n7\n8\n9\"\"\"\n        self.assertIO(input, output)\n\n\ndef resolve():\n    A, B, K = list(map(int, input().split()))\n\n    ans = []\n    for i in range(K):\n        if A+i <= B and A+i not in ans:\n            ans.append(A+i)\n        if B-i >= A and B-i not in ans:\n            ans.append(B-i)\n\n    ans.sort()\n\n    for a in ans:\n        print(a)\n\n\ndef __starting_point():\n    # unittest.main()\n    resolve()\n\n__starting_point()", "passed": true, "time": 0.14, "memory": 14616.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\n\nfor i in range(a, min(b, a + k - 1) + 1):\n    print(i)\nfor i in range(max(b - k + 1, a + k), b + 1):\n    print(i)\n", "passed": true, "time": 0.14, "memory": 14112.0, "status": "done"}, {"code": "A,B,K = list(map(int,input().split()))\nc = 0\nS = []\nif B - A <= K:\n    for i in range(A,B+1):\n        print(i)\n    return\nfor i in range(A,B+1):\n    if c == K:\n        break\n    print(i)\n    S.append(i)\n    c += 1\nfor i in range(B-K+1,B+1):\n    if i not in S:        \n        print(i)\n", "passed": true, "time": 0.14, "memory": 14060.0, "status": "done"}, {"code": "a,b,k=map(int,input().split())\nif b-a+1>k*2:\n  for i in range(a,a+k):\n    print(i)\n  for j in range(b-k+1,b+1):\n    print(j)\nelse:\n  for h in range(a,b+1):\n    print(h)", "passed": true, "time": 0.23, "memory": 14264.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nn = b - a + 1\n\nif n > k * 2:\n  for i in range(k):\n    print(a+i)\n  for i in range(k):\n    print(b-(k-i-1))\nelse:\n  for i in range(a, b+1):\n    print(i)", "passed": true, "time": 0.14, "memory": 14076.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\nif 2*k > b - a:\n    for i in range(a,b + 1):\n        print(i)\nelse:\n    for i in range(k):\n        print(a + i)\n    for j in range(k):\n        print(b - k + 1 + j)", "passed": true, "time": 0.25, "memory": 14380.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\nli = []\nif (b-a)+1 < k or (b-a) < k*2:\n    for i in range(a,b+1):\n        li.append(i)\n    for i in li:\n        print(i)\n    return\nfor i in range(a,a+k):\n    li.append(i)\nfor i in range(b-k+1,b+1):\n    li.append(i)\nfor i in li:\n    print(i)", "passed": true, "time": 0.14, "memory": 14300.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\n\nans = set()\nk = min(k,b-a+1)\nfor i in range(a, a+k):\n    ans.add(i)\n\nfor i in range(b, b - k, -1):\n    ans.add(i)\n\nans=sorted(list(ans))\n\nfor i in (ans):\n    print(i)\n", "passed": true, "time": 0.14, "memory": 14084.0, "status": "done"}, {"code": "a, b, k = map(int,input().split())\nif a+k+1 <= b:\n    for i in range(a, k+a):\n        print(i)\n    if a+k+1 <= b+1-k:\n        for i in range(b+1-k, b+1):\n            print(i)\n    else:\n        for i in range(a+k, b+1):\n            print(i)\nelse:\n    for i in range(a, b+1):\n        print(i)", "passed": true, "time": 0.15, "memory": 14064.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\n[print(i) for i in sorted(set(list(range(a,min(a+k,b+1)))+list(range(max(a,b-k+1),b+1))))]\n", "passed": true, "time": 0.14, "memory": 14292.0, "status": "done"}, {"code": "a,b,k = map(int, input().split())\n\nif b-a+1 > 2*k:\n  for i in range(a,a+k): print(i)\n  for i in range(b-k+1,b+1): print(i)\nelse:  \n  for i in range(a,b+1): print(i)", "passed": true, "time": 0.14, "memory": 14352.0, "status": "done"}, {"code": "A,B,K = list(map(int,input().split()))\n\nA1 = A\nA2 = min(A+K,B+1)\nfor i in range(A1,A2):\n  print(i)\n\nB1 = max(B-K+1,A+K)\nB2 = B+1  \nfor i in range(B1,B2):\n  print(i)\n", "passed": true, "time": 0.14, "memory": 14124.0, "status": "done"}, {"code": "A,B,K = map(int,input().split())\n\nls_1 = [i for i in range(A,min(A+K,B+1))]\nls_2 = [j for j in range(max(A,B-K+1),B+1) if j not in ls_1]\nls = ls_1 + ls_2\n\nfor ans in ls:\n  print(ans)", "passed": true, "time": 0.16, "memory": 14128.0, "status": "done"}, {"code": "A, B, K = list(map(int, input().split()))\n\nif B - A < K*2:\n  for i in range(A, B+1):\n    print(i)\nelse:\n  for i in range(A, A+K):\n    print(i)\n  for i in range(B-K+1, B+1):\n    print(i)\n    \n", "passed": true, "time": 0.15, "memory": 14188.0, "status": "done"}, {"code": "a,b,k=map(int, input().split())\nan=[]\nfor i in range(a,min(a+k,b+1)):\n    an.append(i)\nfor i in range(max(b-k+1,a),b+1):\n    an.append(i)\nan=sorted(list(set(an)))\nfor i in an:\n    print(i)", "passed": true, "time": 0.15, "memory": 14100.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nr = range(a, b+1)\nprint(*sorted(set(r[:k]) | set(r[-k:])), sep='\\n')", "passed": true, "time": 0.14, "memory": 14084.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nn = range(a, b+1)\nfor i in sorted(set(n[:k]) | set(n[-k:])):\n  print(i)", "passed": true, "time": 0.14, "memory": 14260.0, "status": "done"}, {"code": "from collections import OrderedDict\n\nA, B, K = map(int, input().split())\nL = []\nres = []\n\nif K > B-A:\n    for i in range(A, B+1):\n        print(i)\n    return\nelse:\n    for i in range(A, A+K):\n        res.append(i)\n    for i in range(B-K+1, B+1):\n        res.append(i)\n\nres_unique = list(set(res))\nres_unique.sort()\n\nfor i in res_unique:\n    print(i)", "passed": true, "time": 0.14, "memory": 14268.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\n\nfor i in range(k):\n    if a + i > b:\n        break\n    print((a + i))\n\nstart = max(a+k, b-k+1)\n\nfor i in range(start, b+1):\n    print(i)\n", "passed": true, "time": 0.21, "memory": 14048.0, "status": "done"}, {"code": "a, b, k = list(map(int, input().split()))\nlis1 = []\nlis2 = []\nlis3 = []\n\nfor i in range(0, k):\n  ap = a + i\n  bm = b - i\n  lis1.append(ap)\n  lis2.append(bm)\n\nlis3 = lis1 + lis2\nsorted_lis = sorted(set(lis3))\n\nfor ans in sorted_lis:\n  if a <= ans and ans <= b:\n    print(ans)\n  \n", "passed": true, "time": 0.14, "memory": 14104.0, "status": "done"}, {"code": "a,b,k = map(int,input().split())\n\nans = {}\nfor i in range(a,a+k):\n    if i<=b:\n        ans.setdefault(i,0)\n        ans[i] += 1\n    else:\n        break\nfor i in range(b-(k-1),b+1):\n    if a<=i:\n        ans.setdefault(i,0)\n        ans[i] += 1\n    else:\n        break\nfor i in ans.keys():\n    print(i)", "passed": true, "time": 0.14, "memory": 14260.0, "status": "done"}, {"code": "a,b,k = list(map(int, input().split()))\nif b-a+1 < 2*k:\n    for i in range(a,b+1):\n        print(i)\nelse:\n    for i in range(k):\n        print((a+i))\n    for j in range(k):\n        print((b+j-k+1))\n", "passed": true, "time": 0.14, "memory": 14240.0, "status": "done"}, {"code": "a, b, k = map(int, input().split())\nn = []\nfor i in range(k):\n    if a + i > b:\n        break\n    n.append(a + i)\nfor j in range(k):\n    if b - k + 1 + j < a:\n        break\n    if n.count(b - k + 1 + j) <= 0:\n        n.append(b - k + 1 + j)\n[print(num) for num in n]", "passed": true, "time": 0.14, "memory": 14168.0, "status": "done"}]