#include <bits/stdc++.h>
double EPS = 1E-9;
using namespace std;
struct node {
  int par, ind;
};
long long gcd(long long a, long long b) {
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
bool BS(long long key) { return false; }
int main() {
  int n, T, m;
  const int count = 500;
  int a[count][count];
  int b[count];
  int c[count];
  long long res = 0;
  while (cin >> n >> m) {
    int tot = n + m + 1;
    for (int i = 0; i <= n; i++) cout << tot - n + i << " ";
    for (int i = 0; i < m; i++) cout << tot - n - i - 1 << " ";
    cout << endl;
  }
  return 0;
}
