n个灯中,已经亮的有m个,则这m个灯把n个灯分成了若干有未亮的灯的区间(设为k个),每个区间分别有xi个灯。(n - m)个灯点亮的顺序有(n - m)!中情况,在这些情况中,不考虑每个区间内部的顺序,则总情况有(n - m)! / (x1! * x2! *...* xk!)。对于只有一边有灯亮的区间,这个区间内灯的点亮顺序是确定的,即为1;对于两边都有灯亮的区间:假设区间有1个灯,则点亮方法有1中,若灯为2,则点亮方法为2中...若灯为y,则点亮方法有f(y) = 2 * f(y - 1) = ... = 2 ^ (y - 1)。从而,该题答案为:(n - m) ! / (x1! * x2! *...* xk!) * (f(x1) * f(x2) * ... * f(xk)),其中f(xi) = 1,如果第i个区间只有一边有灯亮,f(xi) = 2 ^ (xi - 1),如果第i个区间两边都有灯亮。由于本题答案mod的数是素数,所以很容易求出分母的乘法逆元从而得到答案。代码如下:
/*
* Author: stormdpzh
* Created Time: 2013/6/22 14:05:23
* File Name: c.cpp
*/
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <algorithm>
#include <functional>
#define sz(v) ((int)(v).size())
#define rep(i, n) for(int i = 0; i < n; i++)
#define repf(i, a, b) for(int i = a; i <= b; i++)
#define repd(i, a, b) for(int i = a; i >= b; i--)
#define out(n) printf("%d\n", n)
#define mset(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long lint;
const int INF = 1 << 30;
const int MaxN = 100005;
const int Mod = 1000000007;
lint fac[1005];
int on[1005];
void init()
{
fac[0] = 1;
repf(i, 1, 1004) fac[i] = fac[i - 1] * i % Mod;
}
lint mypow(lint x, int n)
{
int ans = 1;
while(n > 0) {
if(n & 1) ans = ans * x % Mod;
x = x * x % Mod;
n >>= 1;
}
return ans;
}
int main()
{
int n, m;
init();
while(2 == scanf("%d%d", &n, &m)) {
rep(i, m) scanf("%d", &on[i]);
sort(on, on + m);
lint ans = fac[n - m];
lint x = 1;
int tmp, l = 0;
rep(i, m) {
tmp = on[i];
int y = (tmp - l - 1);
if(y > 0) {
x = x * fac[y] % Mod;
if(l != 0) ans = ans * mypow(2, y - 1) % Mod;
}
l = tmp;
}
if(tmp < n) {
int y = (n - tmp);
x = x * fac[y] % Mod;
}
ans = ans * mypow(x, Mod - 2) % Mod;
printf("%I64d\n", ans);
}
return 0;
}