FAOI-R2 B 20pts 求调

#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const ll maxn = 1e5 + 5;
const ll mod = 1e9 + 7;
ll read(){
	char ch;
	ll f = 0, r = 0;
	ch = getchar();
	while(ch > '9' || ch < '0') f |= ch == '-', ch = getchar();
	while(ch <= '9' && ch >= '0') r = (r << 3) + (r << 1) + (ch ^ 48), ch = getchar();
	return f ? -r : r;
}
ll n = read(), m = read(), f[maxn], sum[maxn], x, mn = mod;
int main(){
    for(int i = 1; i <= m; ++i) x = read(), f[x]++, mn = min(mn, x);
    for(int i = mn; i <= n; ++i) f[i] = (f[i] + sum[i - 1] - sum[(i - 1) / 2]) % mod, sum[i] = (sum[i - 1] + f[i]) % mod;
    printf("%lld", f[n]);
    return 0;
}