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: Wrong Answer)

use std::io::stdin;

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

fn main() {
    let input: Vec<i32> = read_stdin().
        split_whitespace().
        map(|n| n.parse::<i32>().unwrap()).
        collect();

    if (input[1] - input[0]) <= input[2] {
        for i in input[0] .. input[1] + 1 {
            println!("{}", i);
        }
    } else {
        for i in input[0] .. (input[0] + input[2]) {
            println!("{}", i);
        }
        for i in (input[1] - input[2]) .. (input[1] + 1) {
            println!("{}", i);
        }
    }
}