#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
//#define N (1000000000+7)
#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}


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