#include "bits/stdc++.h"

using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
typedef __int128 lll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(ll)(n);i>0;i--)
#define REP(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(v) v.begin(),v.end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
const ll inf = 1000000001;
const ll INF = 2e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);



//ax + by = gcd(a, b) となるx, yをもとめる
ll extgcd(ll a, ll b, ll& x, ll& y) {
	ll d = a;
	if (b != 0) {
		d = extgcd(b, a%b, y, x);
		y -= (a / b)*x;
	}
	else {
		x = 1; y = 0;
	}
	return d;
}

pair<ll, ll> crt(ll a1, ll mo1, ll a2, ll mo2) { // return (x,y) y=lcm(a1,a2),x%mo1=a1,x%mo2=a2
	ll g, x, y, z;
	g = extgcd(mo1, mo2, x, y);
	a1 = (a1%mo1 + mo1) % mo1; a2 = (a2%mo2 + mo2) % mo2;
	if (a1%g != a2 % g) return pair<ll, ll>(-1, 0); // N/A
	lll lcm = mo1 * (mo2 / g);
	if (lcm<mo1) return pair<ll, ll>(-2, 0); // overflow

	lll v = a1 + ((a2 - a1) % lcm + lcm)*x%lcm*(mo1 / g);
	return make_pair(((v%lcm) + lcm) % lcm, lcm);
}


int main() {
	int n, m;
	cin >> n >> m;
	vi x(m);
	rep(i, m) {
		cin >> x[i];
	}
	const int N = 10000000;
	vi dp(N);
	vl mods = { 17 * 9920467,592951213 };
	vl ans(mods.size());
	rep(i, mods.size()) {
		fill(all(dp), 0);
		dp[0] = 1;
		rep(j, N) {
			rep(k, m) {
				if (j + x[k] < N) {
					(dp[j + x[k]] += dp[j]) %= mods[i];
				}
			}
		}
		if (n <= N) {
			ans[i] = dp[n - 1];
		}
		else {
			rep(j, 5) {
				rep(k, N) {
					if (k + x[j] < N) {
						continue;
					}
					if (k + x[j] >= n) {
						break;
					}
					(ans[i] += dp[k] * dp[n - (k + 1) - x[j]] % mods[i]) %= mods[i];
				}
			}
		}
	}
	/*
	rep(i, mods.size() - 1) {
		DEBUG(i);
		DEBUG(ans[i]); DEBUG(ans[i + 1]);
		ll x, y;
		extgcd(mods[i], mods[i + 1], x, y);
		ll temp = ans[i] * mods[i + 1] % (mods[i] * mods[i + 1]) * y % (mods[i] * mods[i + 1]);
		temp = (temp + ans[i + 1] * mods[i] % (mods[i] * mods[i + 1]) * x % (mods[i] * mods[i + 1])) % (mods[i] * mods[i + 1]);
		ans[i + 1] = temp;
		mods[i + 1] = mods[i] * mods[i + 1];
		while (ans[i + 1] < 0) {
			ans[i + 1] += mods[i + 1];
		}
		DEBUG(ans[i + 1]);
	}
	cout << ans[1] << endl;
	//*/
	cout << crt(ans[0], mods[0], ans[1], mods[1]).first << endl;
}