#include <iostream>
#include <string>
#include <queue>
#include <vector>
using namespace std;

vector <int> pam;
string s, q;
int n, m;

void probeg(int j) {

	for (int i = j; i < j + m; i++)
		if (s[i] != q[i - j]) return;
	cout << j + 1 << " ";

}


int main()
{
	bool c = true;
	cin >> s >> q;
	n = s.length(), m = q.length();
	for (int i = 0; i < n; i++)
		if (s[i] == q[0]) { probeg(i); c = false; }

	if (c) cout << "none";



	return 0;
}