#include using namespace std; using Int = long long; constexpr static int mod = 1e9 + 7; constexpr static int inf = (1 << 30) - 1; constexpr static Int infll = (1LL << 61) - 1; int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0); #pragma region Debug Template template string to_string(pair p); template string to_string(tuple p); template string to_string(tuple p); string to_string(const string &s) { return '"' + s + '"'; } string to_string(const char *s) { return to_string((string)s); } string to_string(bool b) { return (b ? "true" : "false"); } string to_string(vector v) { bool first = true; string res = "{"; for (int i = 0; i < static_cast(v.size()); i++) { if (!first) { res += ", "; } first = false; res += to_string(v[i]); } res += "}"; return res; } template string to_string(bitset v) { string res = ""; for (size_t i = 0; i < N; i++) { res += static_cast('0' + v[i]); } return res; } template string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; } template string to_string(pair p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template string to_string(tuple p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; } template string to_string(tuple p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #pragma endregion int main() { int N, K; cin >> N >> K; vector s(N); for (int i = 0; i < N; i++) { cin >> s[i]; } set st(s.begin(), s.end()); sort(s.begin(), s.end(), [](string &a, string &b) { int ret1 = 0, ret2 = 0; for (int j = 0; j < a.size(); j++) { ret1 += abs(a[j] - 'D'); ret2 += abs(b[j] - 'D'); } return ret1 > ret2; }); // debug_out(s); int ans = 0; for (int i = 0; i < N; i++) { vector del; for (auto &&t : st) { if (s[i] == t) continue; int cnt = 0; for (int k = 0; k < K; k++) { cnt += (s[i][k] <= t[k]); } if (cnt == K) { del.emplace_back(t); ans++; } } for (auto &&d : del) st.erase(d); } cout << ans << "\n"; }