#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  int a, b;
  vector<int> x;
  cin >> a >> b;
  for (int i = 0; i <= a; i++) {
    x.push_back(i);
    for (int j = 0; j <= b; j++) {
      x.push_back(i + j * 5);
    }
  }
  sort(x.begin(), x.end());  //昇順ソート

  int hozon = x[0];
  for (int i = 0; i < x.size(); i++) {
    if (x[i] > 0 && x[i] != hozon) {
      cout << x[i] << endl;
      hozon = x[i];
    }
  }

  return 0;
}