output_description: Print all the integers that satisfies the condition above in ascending order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B K
attempt: #include <bits/stdc++.h>
  
  using namespace std;
  
  #define rep(i, n) for (int i = 0; i < (int)(n); ++i)
  #define PI 3.141592653589793
  #define MOD 1000000007
  
  typedef long long ll;
  
  int main()
  {
      cin.tie(0);
      ios::sync_with_stdio(false);
  
      int a,b,k;
      cin >> a >> b >> k;
  
      for(int i = a; i < min(a+k, b+1); ++i) cout << i << endl;
      for(int i = max(b-k+1, a+k); i <= b; ++i) cout << i << endl;
  
      return 0;
  }
problem_description: Statement
  
  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.
samples: [{"input": "3 8 2", "output": "3\n    4\n    7\n    8\n    \n\n  * 3 is the first smallest integer among the integers between 3 and 8.\n  * 4 is the second smallest integer among the integers between 3 and 8.\n  * 7 is the second largest integer among the integers between 3 and 8.\n  * 8 is the first largest integer among the integers between 3 and 8.\n\n* * *"}, {"input": "4 8 3", "output": "4\n    5\n    6\n    7\n    8\n    \n\n* * *"}, {"input": "2 9 100", "output": "2\n    3\n    4\n    5\n    6\n    7\n    8\n    9"}]