#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1000100;
int arr[N];
int temp[N];
int dp[N];
int n, m, k, a, b;
const long long INF = (1LL) << 60;
vector<int> v[200];
long long p, q;
int main() {
  while (cin >> a >> b) {
    int n = a + b + 1;
    for (int i = 1; i <= n; i++) arr[i] = i;
    reverse(arr + n - b, arr + 1 + n);
    for (int i = 1; i <= n; i++) cout << arr[i] << " ";
    cout << endl;
  }
  return 0;
}
