#include <cstdio>
using namespace std;
typedef long long ll;
const int N = 100005;
const ll mod = 100003;
int a[N];
ll f[N], inv[N];
int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	int cnt = 0;
	for (int i = n; i >= 1; i--) {
		if (a[i] == 1) {
			cnt++;
			for (int j = 1; j * j <= i; j++) {
				if (i % j == 0) {
					a[j] ^= 1;
					if (i / j != j) {
						a[i / j] ^= 1;
					}
				}
			}
		}
	}
	inv[1] = 1;
	for (int i = 2; i <= n; i++) {
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	}
	f[n] = 1;
	for (int i = n - 1; i >= 1; i--) {
		f[i] = (n + (n - i) * f[i + 1]) % mod * inv[i] % mod;
	}
	ll ans = k;
	for (int i = k + 1; i <= cnt; i++) {
		ans = (ans + f[i]) % mod;
	}
	for (int i = 1; i <= n; i++) {
		ans = ans * i % mod;
	}
	printf("%lld", ans);
	return 0;
}