#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    int a,b;
    cin >> a >> b;
    set<int> res;
    for (int i=0;i<=a;i++){
        for (int j=0;j<=b;j++){
            if (!i && !j) continue;
            res.insert(i + 5 * j);
        }
    }
    vector<int> ans;
    for (auto x:res) ans.push_back(x);
    sort(ans.begin(),ans.end());
    rep(i,ans.size()) cout << ans[i] << endl;
    return 0;
}