1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template <typename A, typename B>
using unordered_map2 = __gnu_pbds::gp_hash_table<A, B>;
using namespace __gnu_pbds;
template <typename T> using ordered_set =
  __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
                   __gnu_pbds::tree_order_statistics_node_update>;
// ordered_set<int> s; s.insert(1); s.insert(2);
// s.order_of_key(1);    // Out: 0.
// *s.find_by_order(1);  // Out: 2.

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, ll b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

char ZnakZnaku(char c) {
  if (c == 'C') {
    return 1;
  }
  if (c == 'N') {
    return -1;
  }
  assert(false);
}

vector<int> OcenStosik(string s) {
  vector<int> ocena;
  assert(!s.empty());
  reverse(s.begin(), s.end());
  int jedynki = 0;
  while ((int) s.size() >= 2 and s.back() == s[(int) s.size() - 2]) {
    jedynki += ZnakZnaku(s.back());
    s.pop_back();
  }
  jedynki += ZnakZnaku(s.back());
  s.pop_back();
  ocena.push_back(jedynki);
  while (!s.empty()) {
    ocena.push_back(ZnakZnaku(s.back()));
    s.pop_back();
  }
  return ocena;
}

int C[33][33];

ll dp_[2][33][24 * 32 * 2 + 1][1 * 2 + 1][32 * 2 + 1];
#define dp(pm, g, j, r, b) (dp_[(pm)][(g)][(j) + 24 * 32][(b) + 1][(r) + 32])

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  cerr << sizeof(dp_) << endl;

  int n, m, k;
  cin >> n >> m >> k;

  for (int i = 0; i <= n; i++) {
    C[i][0] = 1;
    for (int j = 1; j < i; j++) {
      C[i][j] = Dodaj(C[i - 1][j - 1], C[i - 1][j]);
    }
    C[i][i] = 1;
  }

  vector<int> input(m + 1);
  for (int i = 0; i < k; i++) {
    string s;
    cin >> s;
    const vector<int> ocena = OcenStosik(s);
    assert(input.size() >= ocena.size());
    for (int j = 0; j < (int) ocena.size(); j++) {
      input[j] += ocena[j];
    }
  }
  for (int i = (int) input.size() - 1; i >= 1; i--) {
    input[i - 1] += input[i] / 2;
    input[i] %= 2;
  }

  debug() << imie(input);

  const int D = n - k;

  dp(0, 0, 0, 0, 0) = 1;
  for (int pm = 0; pm < m - 1; pm++) {
    const int PM = (pm % 2);
    const int PM1 = (pm + 1) % 2;
    if (PM1) {
      memset((void*) dp_ + sizeof(dp_) / 2, 0, sizeof(dp_) / 2);
    } else {
      memset(dp_, 0, sizeof(dp_) / 2);
    }
    const int input_bit = input[m - pm];
    cerr << "pm = " << pm << " / " << (m - 1) << endl;
    for (int g = 0; g <= D; g++) {
      const int ogr_j = g * m;
      for (int j = -ogr_j; j <= ogr_j; j++) {
        int ogr_r = g;
        if (((ogr_r ^ g ^ input_bit) & 1) == 1) {
          ogr_r--;
          if (ogr_r < 0) continue;
        }
        for (int r = -ogr_r; r <= ogr_r; r += 2) {
          const int presum = (r - g + input_bit) / 2;
          for (int b = -1; b <= 1; b++) {
            const int value1 = dp(PM, g, j, r, b) % mod;
            if (value1) {
              for (int h = 0; g + h <= D; h++) {
                const int value2 = Mnoz(value1, C[g + h][h]);
                const int sum_b = h + b;
                const int new_b = sum_b % 2;
                const int prej = j - (pm + 1) * h + sum_b / 2;
                for (int dh = 0; dh <= h; dh++) {
                  const int value3 = Mnoz(value2, C[h][dh]);
                  const int new_j = prej + (pm * 2 + 1) * dh;
                  ll* ptr = &dp(PM1, g + h, new_j, presum, new_b);
                  constexpr ll modmod = 4 * (ll) mod * mod;
                  for (int d = 0; d <= g; d++) {
                    //DodajDo(ptr[d], Mnoz(value3, C[g][d]));
                    ptr[d] += (ll) value3 * C[g][d];
                    if (ptr[d] >= modmod) {
                      ptr[d] -= modmod;
                    }
                  }
                }
              }
            }
          }
        }
      }
    }
  }

  const int PM = (m - 1) % 2;
  for (int dlugosc = 0; dlugosc <= D; dlugosc++) {
    int wynik = 0;
    const int input_bit_0 = input[0];
    const int input_bit_1 = input[1];

    for (int same = 0; same <= dlugosc; same++) {
      for (int dod = 0; dod <= same; dod++) {
        const int uj = same - dod;
        const int sposoby = Mnoz(C[same][dod], C[dlugosc][same]);
        const int ogr_r = D;
        for (int r = -ogr_r; r <= ogr_r; r++) {
          for (int b = -1; b <= 1; b++) {
            const int sum_1 = r + b + input_bit_1;
            if (sum_1 % 2 == 0) {
              const int ogr_j = D * m;
              const int j = -((dod - uj) * m + sum_1 / 2 + input_bit_0);
              if (-ogr_j <= j and j <= ogr_j) {
                const int value = Moduluj(dp(PM, dlugosc - same, j, r, b));
                DodajDo(wynik, Mnoz(value, sposoby));
              }
            }
          }
        }
      }
    }

    if (dlugosc) cout << " ";
    cout << wynik;
  }
  cout << endl;

  return 0;
}