#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,a,n) for(ll i = (a);i <= (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define pb push_back
#define sz size()
ll i,n,a,b,c,ans;
vector<ll> vec;

int main(){
  int n,m,a;
  vector<int> v;
  cin >> n >> m;
  rep(i,0,n){
    rep(j,0,m){
      a = (i*1)+(j*5);
      v.pb(a);
    }
  }
  sort(v.begin(),v.end());
  n = 0;
  rep(i,0,v.sz){
    if(v[i] > n){
      cout << v[i] << endl;
      n = v[i];
    }
  }
  return 0;
}