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::{stdout, BufWriter, Write};

macro_rules! debug {
    ($($a:expr),*) => {
       // eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}


fn exam_a(){
    let s = get!(String);
    if s.contains("a") && s.contains("b") && s.contains("c") {
        println!("Yes");
    } else {
        println!("No");
    }
}

fn exam_b(){
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    let (A, B, K) = get!(u64, u64, u64);
    if B - A >= K*2 {
        for n in A..A+K {
            writeln!(out, "{}", n).unwrap();
        } 

        if B-K >= A+K {
            for n in B-K..B {
                writeln!(out, "{}", n+1).unwrap();
            }
        } else {
          //  for n in A+K-1..B {
              for n in A+K..B {
                writeln!(out, "{}", n+1).unwrap();
            }
        }
    } else {
        for n in A..B+1 {
            writeln!(out, "{}", n).unwrap();
        }
    }
}

fn exam_c(){
}

fn main() {
    exam_b();
}