#include using namespace std; using ll = long long; #define rep(i,m,n) for(int i=m; i> A >> B; set ans; rep(i, 0, A+1){ rep(j, 0, B+1){ if(i == 0 && j == 0) continue; ans.insert(i + 5*j); } } auto itr = ans.begin(); while(itr != ans.end()){ cout << *itr << endl; itr++; } return 0; }