#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define Sort(x) sort((x).begin(),(x).end())
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define mp make_pair
typedef long long ll;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

ll gcd(ll a,ll b){
    if(a<b){
        int t=a;a=b;b=t;
    }
    int c=a%b;
    while(c!=0){
        a=b;
        b=c;
        c=a%b;
    }
    return b;
}

ll lcm(ll a,ll b){
    return a*b/gcd(a,b);
}

bool isPrime(int x){
    if(x==1)return false;
    if(x==2)return true;
    if(x%2==0)return false;
    for(int i=3;i<=sqrt(x);i+=2){
        if(x%i==0)return false;
    }
    return true;
}

int kaizyo(int x){
    if(x==1)return x;
    else return x*kaizyo(x-1);
}

typedef struct Point{
    int x;
    int y;
} P;

vector<int> v;
int a,b,sum=0;
void dfs(int sum,int a,int b){
    v.pb(sum);
    if(a>0)dfs(sum+1,a-1,b);
    if(b>0)dfs(sum+5,a,b-1);
    return;
}
int main() {
    cin>>a>>b;
    dfs(0,a,b);
    Sort(v);
    v.push_back(-1);
    rep(i,1,v.size()-1){
        if(v[i]!=v[i+1]){
            cout<<v[i]<<endl;
        }else {
            cout<<v[i]<<endl;
            while(v[i]==v[i+1])i++;
        }
    }
    
    return 0;
}