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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)


import java.util.HashSet;
import java.util.Scanner;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author rn-sshawish
 */
public class Main{

    public static void main(String[] args) {
        HashSet<Integer> values = new HashSet<>();
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        int k = input.nextInt();
        int acopy = a;
        StringBuilder out = new StringBuilder();

        for (int i = 0; i < k && acopy <= b; i++) {
            out.append(acopy).append("\n");
            values.add(acopy);
            acopy++;
        }
        int secandCopy = Math.max(a, b - k) + 1;
        for (int i = 0; i < k && secandCopy <= b; i++) {
            if (!values.contains(secandCopy)) {
                out.append(secandCopy).append("\n");
                values.add(secandCopy);
            }
            secandCopy++;
        }
        System.out.print(out);
    }
}