#include #include #include #include using namespace std; vector findNaive (string s, string t) { vector res; int m = s.size (), n = t.size (); for (int i = 0; i + m <= n; i++) { bool found = true; for (int j = 0; j < m; j++) if (s[j] != t[i + j]) { found = false; break; } if (found) res.push_back (i + 1); } return res; } int main () { string s, t; cin >> s >> t; vector res = findNaive (s, t); if (res.empty ()) cout << "none"; else copy (res.begin (), res.end (), ostream_iterator (cout, " ")); return 0; }