#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
using namespace std;
typedef pair <int, int> P;

int mod(int a, int m) {
    return (a % m + m) % m;
}

// 拡張Euclidの互除法
// ap + bq = gcd(a, b) となるp,qを求め、return d = gcd(a,b)
int extGcd(int a, int b, int &p, int &q) {
    int d = a;
    if (b == 0) {
        p = 1;
        q = 0;
    } else {
        d = extGcd(b, a % b, q, p);
        q -= (a / b) * p;
    }
    return d;
}

// Chinese Remainder Theorem
// 解あり -> x = r mod m なら return (r, m)
// 解なし -> return (-1, -1)
P CRT(vector <int> &b, vector <int> &m) {
    int r = 0, M = 1;
    for (int i = 0; i < b.size(); i++) {
        int p, q;
        int d = extGcd(M, m[i], p, q);
        if ((b[i] - r) % d != 0) return {-1, -1};
        int tmp = (b[i] - r) / d * p % (m[i] / d); // s = (b1 - b2) / d
        r += M * tmp; // x = r + s * M * p の形
        M *= m[i] / d; // mod を lcm に更新
    }
    return {mod(r, M), M};
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;

    vector <int> x(m);
    for (int i = 0; i < m; i++) cin >> x[i];

    vector <int> MOD = {168647939, 592951213};
    vector <int> b(2);
    for (int i = 0; i < 2; i++) {
        vector <int> dp(n);
        dp[0] = 1;
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < m; k++) {
                if (j + x[k] < n) {
                    (dp[j + x[k]] += dp[j]) %= MOD[i];
                }
            }
        }
        b[i] = dp[n - 1];
    }

    P p = CRT(b, MOD);
    cout << p.first << "\n";
    return 0;
}