#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;

const int P = ;

const int N = ;

int n , k , cnt;

int a[N] , inv[N] , dp[N];

vector< int > D[N];

template <typename T> inline void chkmax(T &x,T y) { x = max(x,y); }

template <typename T> inline void chkmin(T &x,T y) { x = min(x,y); }

template <typename T> inline void read(T &x)

{

    T f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

int main()

{

    read(n); read(k);

    for (int i = ; i <= n; ++i) read(a[i]);

    inv[] = ;

    for (int i = ; i <= n; ++i) inv[i] = 1ll * (P - P / i) * inv[P % i] % P;

    for (int i = ; i <= n; ++i)

    {

        for (int j = i; j <= n; j += i)

        {

            D[j].push_back(i);

        }

    }

    for (int i = n; i >= ; --i)

    {

        if (a[i])

        {

            for (unsigned j = ; j < D[i].size(); ++j)

                a[D[i][j]] ^= true;

            ++cnt;

        }

    }

    int ans = ;

    if (cnt <= k)

        ans = cnt;

    else

    {

        dp[n] = ;

        for (int i = n - ; i >= ; --i) dp[i] = (1ll * dp[i + ] * (n - i) % P * inv[i] % P + 1ll * n * inv[i] % P) % P;

        for (int i = cnt; i > k; --i) ans = (ans + dp[i]) % P;

        ans = (ans + k) % P;

    }

    for (int i = ; i <= n; ++i) ans = 1ll * ans * i % P;

    printf("%d\n" , ans);

    return ;

}