#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int f(string &s, string t) {
int ret = 0;
rep(i, (int)s.size() - t.size() + 1) {
string u = s.substr(i, t.size());
if (t == u)ret++;
}
return ret;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k; cin >> n >> k;
string s; cin >> s;
int mx = 0;
set<string>ans;
rep(i, s.size() - k + 1) {
string t = s.substr(i, k);
int cnt = f(s, t);
if (cnt == mx) {
ans.insert(t);
}
else if (cnt > mx) {
mx = cnt;
ans.clear();
ans.insert(t);
}
}
// cout << ans.size() << endl;
cout << mx << endl;
for (auto e : ans)cout << e << " ";
cout << endl;
return 0;
}
Main.cpp: In function ‘int f(std::string&, std::string)’:
Main.cpp:11:37: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
11 | #define rep(i, n) for (int i = 0; i < (n); ++i)
| ^
Main.cpp:22:9: note: in expansion of macro ‘rep’
22 | rep(i, (int)s.size() - t.size() + 1) {
| ^~~
Main.cpp: In function ‘int main()’:
Main.cpp:11:37: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
11 | #define rep(i, n) for (int i = 0; i < (n); ++i)
| ^
Main.cpp:35:9: note: in expansion of macro ‘rep’
35 | rep(i, s.size() - k + 1) {
| ^~~