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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Text.RegularExpressions;

namespace ConsoleApp2
{
    class Program
    {
        static void Main(string[] args)
        {
            string str = Console.ReadLine(); //標準入力
            //string str = "2 9 100";
            string[] str2 = str.Split(' ');
            int a, b, c;

            a = int.Parse(str2[0].ToString());
            b = int.Parse(str2[1].ToString());
            c = int.Parse(str2[2].ToString());

            int[] calc1 = new int[c];
            int[] calc2 = new int[c];

            int index = 0;
            for (int i = a; i < a + c; i++)
            {

                calc1[index] = i;
                index++;
            }
            index = 0;
            for (int i = b; i > b - c; i--)
            {

                calc2[index] = i;
                index++;
            }

            int[] dst;
            if (a + (c - 1) < b - (c + 1))
            {
                dst = new int[c * 2];

                index = 0;
                for (int i = 0; i < calc1.Length; i++)
                {
                    dst[index] = calc1[i];
                    index++;
                }
                for (int i = calc2.Length - 1; i >= 0; i--)
                {
                    dst[index] = calc2[i];
                    index++;
                }
            }
            else
            {
                dst = new int[b - a + 1];

                index = 0;
                for (int i = a; i <= b; i++)
                {
                    dst[index] = i;
                    index++;
                }
            }
            for (int i = 0; i < dst.Length; i++)
            {
                Console.WriteLine(dst[i]);
            }
        }
    }
}