For this Question: Newton is very popular and got a lot of gifts at the end of the year 1722. 
He received a total of 2,000,001 gifts. He placed them on a number line such that the coordinates of the gifts are -1000000, -999999, -999998, ... 999998, 999999, 1000000.
Among these gifts, some <em>K</em> consecutive gifts are Christmas gifts and the rest are New Year gifts. Additionally, Newton knows that the gift at the X-th coordinate is a Christmas gift. Print all the coordinates that may contain a Christmas gift.The first and the only line of the input contains 2 integers, K and X

<b>Constraints:</b>
<ul><li>1 &le; K &le; 100</li><li>0 &le; X &le; 100</li></ul>Output the answer in a single lineSample Input 1:
4 7

Sample Output 1:
4 5 6 7 8 9 10

Sample Input 2:
3 0

Sample Output 2:
-2 -1 0 1 2

<b>Sample Explanation 1:</b>
We know that there are 4 Christmas Gifts and also that the Gift at 7 coordinate is also a Christmas Gift.
So the possible cases are:
1) Gifts at coordinates 4, 5, 6, and 7 are Christmas Gifts
2) Gifts at coordinates 5, 6, 7, and 8 are Christmas Gifts
3) Gifts at coordinates 6, 7, 8, and 9 are Christmas Gifts
4) Gifts at coordinates 7, 8, 9, and 10 are Christmas Gifts
, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;

int main() {
    int k,x;
    cin >> k >> x;
    for(int i = x-k+1;i<x+k;i++){
        cout << i << " ";
    }
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?