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.

Examples

Input

3 8 2


Output

3
4
7
8


Input

4 8 3


Output

4
5
6
7
8


Input

2 9 100


Output

2
3
4
5
6
7
8
9
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int A,B,K;cin>>A>>B>>K;
  int i=A;
  for(;i<(A+K<=B? A+K:B); i++)cout<<i<<endl;
  if(i<B-K+1)i=B-K+1;
  for(;i<=B; i++){
    cout<<i<<endl;
  }
}