Problem:
Score : 200 points

Problem 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.

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 1

3 8 2

Sample Output 1

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.

Sample Input 2

4 8 3

Sample Output 2

4
5
6
7
8

Sample Input 3

2 9 100

Sample Output 3

2
3
4
5
6
7
8
9

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::io;

fn read_line()-> String {
    let mut s = String::new();
    let _ = io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}

fn main() {
	let mut n = read_line().split_whitespace().map(|e|e.parse().unwrap())
	.collect::<Vec<i32>>();
	if (n[1] - n[0]) < n[2] || n[1] <= n[2] {
		let mut vec = (n[0]..(n[1]+1)).collect::<Vec<i32>>();
		vec.sort();
		for i in vec.iter() {
			println!("{}",i);
		}
	}else{
		let mut vec = (n[0]..(n[0]+n[2])).collect::<Vec<i32>>();
		let mut vec2 = (n[1]-(n[2]-1)..(n[1]+1)).collect::<Vec<i32>>();
		vec.append(&mut vec2);
		vec.sort();
		vec.dedup();
		for i in vec.iter() {
			println!("{}",i);
		}
	}
}