#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx")

#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 <map>
#include <numeric>
#include <queue>
#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> 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; }


unsigned M;
void Add(unsigned &t, unsigned f) {
  t += f;
  t = (t >= M) ? (t - M) : t;
}
void Sub(unsigned &t, unsigned f) {
  t -= f;
  t = (t >= M) ? (t + M) : t;
}


unsigned dp[46][50'010];
unsigned ans[100'010];

int main() {
  int N, K;
  int A[110];
  
  for (; ~scanf("%d%u%d", &N, &M, &K); ) {
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    sort(A, A + N);
    
    const bool rev = chmin(K, N - K);
    
    int ASum[110];
    ASum[0] = 0;
    for (int i = 0; i < N; ++i) {
      ASum[i + 1] = ASum[i] + A[i];
    }
    const int S = ASum[N];
    const int T = S / 2;
    
    int lbs[110], ubs[110];
    // K
    for (int i = 0; i <= N; ++i) {
      lbs[i] = max(0, K - (N - i));
      ubs[i] = min(i, K);
    }
#ifdef LOCAL
    memset(dp, 0, sizeof(dp));
#endif
    dp[0][0] = 1 % M;
    for (int i = 0; i < N; ++i) {
      for (int k = ubs[i + 1] - 1; k >= lbs[i]; --k) {
        const int mn = ASum[k];
        const int mx = min(ASum[i] - ASum[i - k], T - A[i]);
        for (int x = mn; x <= mx; ++x) {
          Add(dp[k + 1][x + A[i]], dp[k][x]);
        }
      }
    }
    for (int x = 0; x <= T; ++x) {
      ans[x] = dp[K][x];
    }
    
    // N - K
    if (K == N - K) {
      for (int x = 0; x <= T; ++x) {
        ans[S - x] = dp[K][x];
      }
    } else {
      for (int i = 0; i <= N; ++i) {
        lbs[i] = max(0, (N - K) - (N - i));
        ubs[i] = min(i, (N - K));
      }
      const int len = K + 1;
      memset(dp, 0, sizeof(dp));
      dp[0][0] = 1 % M;
      for (int i = 0; i < N; ++i) {
        for (int k = ubs[i + 1] - 1; k >= lbs[i]; --k) {
          const int pos0 = k % len;
          const int pos1 = (k + 1) % len;
          const int mn = ASum[k];
          const int mx = min(ASum[i] - ASum[i - k], T - A[i]);
          for (int x = mn; x <= mx; ++x) {
            Add(dp[pos1][x + A[i]], dp[pos0][x]);
          }
        }
        for (int k = lbs[i]; k < lbs[i + 1]; ++k) if (k + len <= N - K) {
          const int pos = k % len;
          memset(dp[pos], 0, (T + 1) * sizeof(dp[0][0]));
        }
      }
      {
        const int pos = (N - K) % len;
        for (int x = 0; x <= T; ++x) {
          ans[S - x] = dp[pos][x];
        }
      }
    }
    
    if (rev) {
      reverse(ans, ans + (S + 1));
    }
    
    for (int x = 1; x <= S; ++x) {
      if (x > 1) printf(" ");
      printf("%u", ans[x]);
    }
    puts("");
  }
  return 0;
}