#include <iostream>
#include <cstdio>

using namespace std;

typedef long long LL;

const int N = 1e5 + 5, P = 100003;

int n, k, a[N], inv[N], f[N], cnt;

int main() {
	scanf("%d%d", &n, &k);
	inv[1] = 1;
	for (int i = 1; i <= n; i++) {
		scanf("%d", a + i);
	}
	for (int i = 2; i <= n; i++) {
		inv[i] = (LL)(P - P / i) * inv[P % i] % P;
	}
	for (int i = n; i; i--) {
		f[i] = ((LL)i * inv[n] % P + (LL)(n - i) * inv[n] % P * (f[i + 1] + 1) % P) * n % P * inv[i] % P;
	}
	for (int i = n; i; i--) {
		if (a[i]) {
			++cnt;
			for (int j = 1; j * j <= i; j++) {
				if (i % j == 0) {
					a[j] ^= 1;	
					if (i / j != j) a[i / j] ^= 1;
				} 
			}
		}
	}
	int ans = 0;
	if (k < cnt) {
		ans = k;
		for (int i = cnt; i > k; i--)
			ans = (ans + f[i]) % P;
	} else ans = cnt;
	for (int i = 1; i <= n; i++)
		ans = (LL)ans * i % P;
	printf("%d\n", ans);
}