#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#define REP(i, n) for(long long i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

int main() {
	int a, b;
	cin>>a>>b;
	set<int> s;
	for(int i = 0; i <= a; ++i) {
		for(int j = 0; j <= b; ++j) {
			s.insert(i * 1 + 5 * j);
		}
	}
	auto ite = s.begin();
	while(ite != s.end()) {
		if(*ite != 0) cout<<*ite<<endl;
		++ite;
	}
}