#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

map<char, ll> m;

int main()
{
	int A, B;
	cin >> A >> B;
	set<ll> v;

	for (int i = 0; i <= B; i++) {
		for (int j = 0; j <= A; j++) {
			v.insert(j+(i*5));
		}
	}

	for (auto itr = v.begin(); itr != v.end(); itr++) {
		if (*itr == 0)continue;
		cout << *itr << endl;
	}

	return 0;
}