#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
#define ll long long

const int INF = 1e9;
const long long LLINF = 1e18;

using namespace std;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
int dy8[] = {0,1,1,1,0,-1,-1,-1};
int dx8[] = {1,1,0,-1,-1,-1,0,1};

/*==================================================*/
/*variable*/
int A, B;

/*==================================================*/
/*function*/

/*==================================================*/

int main() {
    cin>>A>>B;
    vector<int> v;
    set<int> st;
    REP(i,0,A+1){
        REP(j,0,B+1){
            v.push_back(i + 5*j);
        }
    }
    sort(v.begin(), v.end());
    st.insert(0);
    REP(i,0,v.size()){
        if(st.find(v[i]) == st.end()) cout<<v[i]<<endl;
        st.insert(v[i]);
    }

    return 0;
}