#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

ll powMod(ll n, ll k, ll m) {
	if (k == 0) {
		return 1;
	} else if (k % 2 == 1) {
		return powMod(n, k - 1, m) * n % m;
	} else {
		ll t = powMod(n, k / 2, m);
		return t * t % m;
	}
}

int main() {
	ll a, b;
	cin >> a >> b;
	
	vector<ll> v;

	for (int i = 1; i <= a; i++) {
		v.push_back(i);
	}
	for (int i = 1; i <= b; i++) {
		v.push_back(i*5);
	}
	for (int i = 1; i <= a; i++) {
		for (int j = 1; j <= b; j++) {
			v.push_back(i+j*5);
		}
	}
	sort(all(v));
	v.erase(unique(all(v)),v.end());

	for (auto l : v) {
		cout << l << endl;
	}	
}