#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define allsort(v) sort(v.begin(),v.end())
const ll mod = 1e9 + 7;
const int INF = 1e9;

int main() {
	cin.sync_with_stdio(false);
	int a, b;
	cin >> a >> b;
	vector<int>x, y;
	x.push_back(0);
	y.push_back(0);
	
	reps(i,1, a+1) {
		x.push_back(i);
	}
	reps(i,1, b+1) {
		y.push_back(i * 5);
	}
	vector<int>sum;
	rep(i, x.size()) {
		rep(j, y.size())sum.push_back(x[i] + y[j]);
	}
	allsort(sum);
	sum.erase(unique(sum.begin(), sum.end()), sum.end());
	reps(i,1, sum.size()) {
		cout << sum[i] << endl;
	}
	return 0;
}