#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit (1<<18)
#define inf 1000000
#define N 2100000
#define mod 1000000007
#define inu "strmatch.in"
#define outu "strmatch.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int sol[N],k,n,m,t,p[N];
string s1,s2;
int main ()
{
	f>>s1;
	f>>s2;
	s1=' '+s1;
	s2=' '+s2;
	n=s1.length();
	m=s2.length();
	n--;
	m--;
	FOR(i,2,n)
	{
		while(k&&s1[i]!=s1[k+1])
			k=p[k];
		if(s1[i]==s1[k+1]) k++;
		p[i]=k;
	}
	k=0;
	FOR(i,1,m)
	{
		while(k&&s2[i]!=s1[k+1])
			k=p[k];
		if(s2[i]==s1[k+1]) k++;
		if(k==n)
			sol[++t]=i-n;
		if(t==1000)
			break;
	}
	g<<t<<"\n";
	FOR(i,1,t)
	g<<sol[i]<<" ";
	return 0;
}