#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, b); }
template <class T>
inline void chmax(T &a, const T &b) { a = max(a, b); }
template <class T>
inline bool kbit(const T &x, const int &k) { return ((x >> k) & 1LL); }
inline int popcount(const int &n) { return __builtin_popcount(n); }
inline ll popcountll(const ll &n) { return __builtin_popcountll(n); }
inline ll mask(const ll &k) { return (1LL << k) - 1LL; }
template <class T>
void zip(V<T> &v) {
    sort(all(v));
    v.erase(unique(all(v)), v.end());
}
template <class T>
int lwb(V<T> &v, const T &x) { return lower_bound(all(v), x) - v.begin(); }
template <class T>
int upb(V<T> &v, const T &x) { return upper_bound(all(v), x) - v.begin(); }
void dump() {
    cerr << '\n';
}
template <class Head, class... Tail>
void dump(Head &&head, Tail &&...tail) {
    cerr << head << (sizeof...(Tail) == 0 ? " " : ", ");
    dump(std::move(tail)...);
}
template <class T>
void print(const vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
template <class T>
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}
constexpr char sp = ' ', newl = '\n';
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
constexpr ll INF = (1LL << 60) - 1LL;
constexpr ll MOD = 1e9 + 7;
//////////////////////////////////////////////INSERT ABOVE HERE
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll a, b;
    cin >> a >> b;
    V<ll> p = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
    V<int> c(b - a + 1);
    for (ll i = a; i <= b; i++) {
        for (int j = 0; j < p.size(); j++) {
            if (i % p[j] == 0) {
                c[i - a] |= (1 << j);
            }
        }
    }
    int n = b - a + 1;
    V<V<ull>> dp(n + 1, V<ull>(1 << 20));
    dp[0][0] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < (1 << 20); j++) {
            dp[i + 1][j] += dp[i][j];
            if ((j & c[i]) == 0) {
                dp[i + 1][j | c[i]] += dp[i][j];
            }
        }
    }
    ull res = 0;
    for (int j = 0; j < (1 << 20); j++) {
        res += dp[n][j];
    }
    cout << res << newl;
}

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

typedef long long ll;

int main() {
    int N, M, X;
    cin >> N >> M;
    vector<bool> A(1001, false), B(1001, false);
    rep(i, N) {
        cin >> X;
        A[X] = true;
    }
    rep(i, M) {
        cin >> X;
        B[X] = true;
    }
    rep(i, 1001) {
        if (A[i] ^ B[i]) cout << i << " ";
    }
    cout << "\n";
}