#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isSquare(T x) {
  T y = sqrt(x + 0.5);
  return (y * y) == x;
}
template <class T1, class T2>
inline T1 gcd(T1 a, T2 b) {
  return b ? gcd(b, a % b) : a;
}
template <class T1, class T2>
inline T1 eqMin(T1 &x, const T2 &y) {
  if (T1(y) < x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 eqMax(T1 &x, const T2 &y) {
  if (T1(y) > x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 min(const T1 &x, const T2 &y) {
  return x < (T1)y ? x : (T1)y;
}
template <class T1, class T2>
inline T1 max(T1 &x, const T2 &y) {
  return x > (T1)y ? x : (T1)y;
}
template <typename T>
inline T getint() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') p = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * p;
}
struct _flag_t {
  string val;
} const _1d{", "}, _2d{"\n  "};
_flag_t _flag = _1d;
ostream &operator<<(ostream &os, _flag_t flag) {
  _flag = flag;
  return os;
}
template <class It>
ostream &_out(ostream &os, It f, It l) {
  if (f == l) return os << "{}";
  _flag_t cur_flag = _flag;
  os << _1d << "{ " << *f;
  for (; ++f != l; os << cur_flag.val << *f)
    ;
  return os << " }";
}
template <class C>
auto operator<<(ostream &os, C const &cont)
    -> decltype(begin(cont), end(cont), cont.size(), declval<ostream &>()) {
  return _out(os, begin(cont), end(cont));
}
ostream &operator<<(ostream &os, string const &s) { return os << s.data(); }
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
  return os << "[" << p.first << ", " << p.second << "]";
}
const double PI = acos(-1);
const double EPS = 1e-8;
const int INF = (int)2e9;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)200;
struct KArs {
  vector<vector<long long>> dp;
  int n;
  KArs() {}
  KArs(int _n) {
    n = _n;
    dp = vector<vector<long long>>(n + 1, vector<long long>(n + 1, 0));
  }
  KArs operator*(const KArs &o) const {
    KArs res(n);
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        for (int k = 0; k <= n; k++) {
          res.dp[i][k] += dp[i][j] * o.dp[j][k];
          res.dp[i][k] %= MOD;
        }
      }
    }
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        res.dp[i][j] %= MOD;
      }
    }
    return res;
  }
};
int n, k;
int arr[MAXN];
int zeros, ones, Z;
KArs mat;
void input() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    zeros += arr[i] == 0;
    ones += arr[i] == 1;
  }
  for (int i = 1; i <= zeros; i++) {
    Z += arr[i] == 0;
  }
}
KArs power(int step) {
  KArs res(mat.n);
  KArs x = mat;
  for (int i = 0; i <= mat.n; i++) {
    res.dp[i][i] = 1;
  }
  for (; step; x = x * x, step >>= 1) {
    if (step & 1) res = res * x;
  }
  return res;
}
long long f(long long x) { return x * (x - 1) / 2; }
void init() {
  mat = KArs(zeros);
  for (long long prefZ = 0; prefZ <= zeros; prefZ++) {
    long long prefO = zeros - prefZ;
    long long sufZ = zeros - prefZ;
    long long sufO = ones - prefO;
    mat.dp[prefZ][prefZ] = (prefZ * sufZ + prefO * sufO + f(prefZ) + f(sufZ) +
                            f(prefO) + f(sufO) + prefZ * prefO + sufZ * sufO) %
                           MOD;
    if (prefZ > 0) mat.dp[prefZ][prefZ - 1] = prefZ * sufO;
    if (prefZ != zeros) {
      mat.dp[prefZ][prefZ + 1] = prefO * sufZ;
    }
  }
}
long long power(long long x, long long step) {
  long long res = 1;
  for (; step; step >>= 1, x = (x * x) % MOD) {
    if (step & 1) {
      res = (res * x) % MOD;
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  input();
  init();
  KArs a = power(k);
  long long x = 0, y = 0;
  for (int i = 0; i <= zeros; i++) {
    y += a.dp[Z][i];
  }
  y %= MOD;
  x = a.dp[Z][zeros];
  cout << (x * power(y, MOD - 2)) % MOD;
}
