#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  int A,B; cin >> A >> B;
  map<int,int> ans;
  for(int i = 0; i <= A; i++) {
    for(int j = 0; j <= B; j++) {
      int x = (i * 1) + (j * 5);
      ans[x] = 1;
    }
  }
  ans.erase(0);
  for (const auto& [key, value] : ans) {
    cout << key << endl;
  }
}