#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>

using namespace std;

int judge[101][101] = {};
int A=0;
int B=0;
vector<int> ans;
void dfs(int a, int b){
	if(a>A|| b>B|| judge[a][b] == 1){
		return;
	}

	if((1*a+5*b) !=0){
	ans.push_back(1*a+5*b);
	}
	judge[a][b] =1;

	dfs(a+1,b);

	dfs(a,b+1);



}

int main() {

	cin>>A>>B;

	dfs(0,0);

	sort(ans.begin(),ans.end());

	ans.erase(unique(ans.begin(),ans.end()),ans.end());

	for(int i=0; i<ans.size(); i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}