#include <bits/stdc++.h>

#include <atcoder/convolution>

#include <atcoder/modint>
#include <vector>

template <class T>
struct Factorial {
    int n;
    std::vector<T> fact;
    std::vector<T> revfact;

    Factorial(int n) : n(n) {
        fact.resize(n + 1);
        revfact.resize(n + 1);
        fact[0] = 1;
        for (int i = 0; i < n; ++i) fact[i + 1] = fact[i] * (i + 1);

        revfact[n] = fact[n].inv();
        for (int i = n - 1; i >= 0; --i) revfact[i] = revfact[i + 1] * (i + 1);
    }

    T comb(int n, int r) {
        if (n < r || r < 0) return 0;
        return fact[n] * revfact[r] * revfact[n - r];
    }

    T perm(int n, int r) {
        if (n < r || r < 0) return 0;
        return fact[n] * revfact[n - r];
    }
};


#include <algorithm>
#include <cassert>
#include <vector>

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct CoordComp {
    std::vector<T> v;
    bool sorted;

    CoordComp() : sorted(false) {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        std::sort(v.begin(), v.end());

        v.erase(std::unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};


#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

using namespace std;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

using mint = atcoder::modint;

int main() {
    string s;
    int m;
    cin >> s >> m;
    constexpr int MOD = 90001;
    int n = 0;
    for (auto c : s) {
        n *= 10;
        n += c - '0';
        n %= MOD - 1;
    }
    if (n == 0) n = MOD - 1;
    vector<int> a[m + 1];
    rep(i, m) {
        int K;
        scanf("%d", &K);
        a[i].resize(K);
        rep(j, K) scanf("%d", &a[i][j]);
    }
    a[m].push_back(1);

    mint::set_mod(MOD);
    Factorial<mint> fc(n);
    vector<lint> f = {1};
    rep(i, m + 1) {
        vector<lint> g(n + 1, 0);
        rep(j, n + 1) {
            for (auto t : a[i])
                if (j % t == 0) {
                    g[j] = fc.revfact[j].val();
                    break;
                }
        }
        f = atcoder::convolution_ll(f, g);
        f.resize(n + 1);
        for (auto &x : f) x %= MOD;
    }
    mint ans = fc.fact[n] * f[n];
    printf("%u\n", ans.val());
}