// いろいろ高速化 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #ifndef HIDDEN_IN_VS // 折りたたみ用 // 警告の抑制 #define _CRT_SECURE_NO_WARNINGS // ライブラリの読み込み #include using namespace std; // 型名の短縮 using ll = long long; using ull = unsigned long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9) using pii = pair; using pll = pair; using pil = pair; using pli = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vvvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vvvvl = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vc = vector; using vvc = vector; using vvvc = vector; using vd = vector; using vvd = vector; using vvvd = vector; template using priority_queue_rev = priority_queue, greater>; using Graph = vvi; // 定数の定義 const double PI = acos(-1); const vi DX = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左) const vi DY = { 0, 1, 0, -1 }; int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620; // 入出力高速化 struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp; // 汎用マクロの定義 #define all(a) (a).begin(), (a).end() #define sz(x) ((int)(x).size()) #define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x)) #define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x)) #define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");} #define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順 #define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順 #define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順 #define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能) #define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能) #define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索(昇順) #define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素(昇順) #define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順) #define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod #define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去 #define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了 #define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定 // 汎用関数の定義 template inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; } template inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す) template inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す) template inline T get(T set, int i) { return (set >> i) & T(1); } // 演算子オーバーロード template inline istream& operator>>(istream& is, pair& p) { is >> p.first >> p.second; return is; } template inline istream& operator>>(istream& is, vector& v) { repea(x, v) is >> x; return is; } template inline vector& operator--(vector& v) { repea(x, v) --x; return v; } template inline vector& operator++(vector& v) { repea(x, v) ++x; return v; } #endif // 折りたたみ用 #if __has_include() #include using namespace atcoder; #ifdef _MSC_VER #include "localACL.hpp" #endif //using mint = modint1000000007; using mint = modint998244353; //using mint = modint; // mint::set_mod(m); namespace atcoder { inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; } inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; } } using vm = vector; using vvm = vector; using vvvm = vector; using vvvvm = vector; #endif #ifdef _MSC_VER // 手元環境(Visual Studio) #include "local.hpp" #else // 提出用(gcc) inline int popcount(int n) { return __builtin_popcount(n); } inline int popcount(ll n) { return __builtin_popcountll(n); } inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; } inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; } inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; } inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; } #define gcd __gcd #define dump(...) #define dumpel(v) #define dump_list(v) #define dump_mat(v) #define input_from_file(f) #define output_to_file(f) #define Assert(b) { if (!(b)) while (1) cout << "OLE"; } #endif // メモリ制限 75 MB だった. constexpr ll MOD = 100000000000000007LL; void MLE() { int n, m; cin >> n >> m; vi x(m); cin >> x; vl dp(n); dp[0] = 1; rep(i, n) { rep(j, m) { int ni = i + x[j]; if (ni < n) dp[ni] = (dp[ni] + dp[i]) % MOD; } } // dump(dp); cout << dp[n - 1] << endl; } constexpr int MOD1 = 17; constexpr int MOD2 = 9920467; constexpr int MOD3 = 592951213; // 81.4MB / 75MB で惜しかった. void MLE2() { int n, m; cin >> n >> m; vi x(m); cin >> x; vl rem(3), mod(3); { vi dp(n); dp[0] = 1; rep(i, n) { rep(j, m) { int ni = i + x[j]; if (ni < n) dp[ni] = (dp[ni] + dp[i]) % MOD1; } } rem[0] = dp[n - 1]; mod[0] = MOD1; dp.resize(0); dp.shrink_to_fit(); } { vi dp(n); dp[0] = 1; rep(i, n) { rep(j, m) { int ni = i + x[j]; if (ni < n) dp[ni] = (dp[ni] + dp[i]) % MOD2; } } rem[1] = dp[n - 1]; mod[1] = MOD2; dp.resize(0); dp.shrink_to_fit(); } { vi dp(n); dp[0] = 1; rep(i, n) { rep(j, m) { int ni = i + x[j]; if (ni < n) dp[ni] = (dp[ni] + dp[i]) % MOD3; } } rem[2] = dp[n - 1]; mod[2] = MOD3; dp.resize(0); dp.shrink_to_fit(); } auto [res, tmp] = crt(rem, mod); cout << res << endl; } int main() { // input_from_file("input.txt"); // output_to_file("output.txt"); int n, m; cin >> n >> m; vi x(m); cin >> x; int n1 = 100; int n2 = (n + n1 - 1) / n1; vvl dp(n2); dp[0].resize(n1); dp[0][0] = 1; rep(i, n) { rep(j, m) { int ni = i + x[j]; if (ni < n) { if (dp[ni / n1].empty()) dp[ni / n1].resize(n1); dp[ni / n1][ni % n1] = (dp[ni / n1][ni % n1] + dp[i / n1][i % n1]) % MOD; } } if (i % n1 == n1 - 1 && i != n - 1) { dp[i / n1].resize(0); dp[i / n1].shrink_to_fit(); } } // dumpel(dp); cout << dp[(n - 1) / n1][(n - 1) % n1] << endl; }