/*
    Look at me!
    Look at me!
    The monster inside me has grown this big!
*/

#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define eps 1.e-6
#define N 1010
#define M 2000100
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int poz[N],pi[M],n,m,k,sol;
char s[M],p[M];
int main ()
{
	f>>(p+1)>>(s+1);
	n=strlen(p+1);
	m=strlen(s+1);
	FOR(i,2,n)
	{
		while(k&&p[i]!=p[k+1])
			k=pi[k];
		if(p[i]==p[k+1])
			++k;
		pi[i]=k;
	}
	k=0;
	FOR(i,1,m)
	{
		while(s[i]!=p[k+1]&&k)
			k=pi[k];
		if(s[i]==p[k+1])
			++k;
		if(k==n)
		{
			++sol;
			if(sol<=1000)
				poz[sol]=i-n;
		}
	}
	g<<sol<<"\n";
	sol=min(sol,1000);
	FOR(i,1,sol)
	g<<poz[i]<<" ";
	return 0;
}