#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


int s1(int n) {
  return n*(n+1)/2;
}

int N, Q;
vector<int> A;

Mint dp[2][410][410];

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.assign(N + 2, 0);
    for (int i = 1; i <= N; ++i) {
      scanf("%d", &A[i]);
    }
    
    const Mint all = Mint(s1(N)).pow(Q);
    
    vector<int> as(A.begin() + 1, A.begin() + (N + 1));
    sort(as.begin(), as.end());
    
    for (int l = 0; l <= N + 1; ++l) for (int r = l + 1; r <= N + 1; ++r) dp[0][l][r] = 0;
    for (int h = 1; h < N; ++h) {
      /*
        0: <  as[h]
        1: >= as[h]
        subtract [< as[h]]
      */
      int l = 0;
      for (int r = 1; r <= N + 1; ++r) if (r == N + 1 || A[r] >= as[h]) {
        dp[0][l][r] += (as[h] - as[h - 1]);
        l = r;
      }
    }
    
    /*
      l       r
      100...001
    */
    for (int q = 0; q < Q; ++q) {
      auto crt = dp[q & 1], nxt = dp[(q + 1) & 1];
      for (int l = 0; l <= N + 1; ++l) for (int r = l + 1; r <= N + 1; ++r) nxt[l][r] = 0;
      for (int l = 0; l <= N + 1; ++l) for (int r = l + 1; r <= N + 1; ++r) {
        nxt[l][r] += crt[l][r] * (s1(l - 1) + s1(r - l - 1) + s1(N - r));
        // for (int ll = l; ll < r; ++ll) nxt[ll][r] += crt[l][r] * l;
        // for (int rr = r; rr > l; --rr) nxt[l][rr] += crt[l][r] * (N + 1 - r);
      }
      for (int r = 0; r <= N + 1; ++r) {
        Mint sum = 0;
        for (int l = 0; l < r; ++l) nxt[l][r] += sum += crt[l][r] * l;
      }
      for (int l = 0; l <= N + 1; ++l) {
        Mint sum = 0;
        for (int r = N + 1; r > l; --r) nxt[l][r] += sum += crt[l][r] * (N + 1 - r);
      }
    }
    vector<Mint> ans(N + 2, 0);
    for (int l = 0; l <= N + 1; ++l) for (int r = l + 1; r <= N + 1; ++r) {
      ans[l + 1] += dp[Q & 1][l][r];
      ans[r    ] -= dp[Q & 1][l][r];
    }
    for (int i = 1; i <= N; ++i) ans[i + 1] += ans[i];
    
    for (int i = 1; i <= N; ++i) ans[i] = as[N - 1] * all - ans[i];
    
    for (int i = 1; i <= N; ++i) {
      if (i > 1) printf(" ");
      printf("%u", ans[i].x);
    }
    puts("");
  }
  return 0;
}