#include <iostream> #include <algorithm> #include <vector> #include <map> #include <string> #include <numeric> #include <cstring> #include <cmath> #include <set> #include <queue> #include <stack> const int MOD = 1e9 + 7; const int iINF = 1000000000; const long long int llINF = 1000000000000000000; #define rep(i, n) for (int i = 0; i < (n); i++) using namespace std; using ll = long long int; using P = pair<int, int>; using edge = struct { int to; int cost; }; int main() { int A, B; cin >> A >> B; set<int> s; for (int i = 0; i < A + 1; i++) for (int j = 0; j < B + 1; j++) s.insert(i + j * 5); for (auto x : s) if (x != 0) cout << x << endl; return 0; }