#include <bits/stdc++.h>
using namespace std;
string s,s2;
int i,j,n,k,sol(0);
int pi[5000013];
vector <int> V;

void kmp()
{
 for (i=1;i<s.size();++i)
   {
   	int k=pi[i-1];
   	while(s[i]!=s[k] && k>0) k=pi[k-1];
   	if (s[i]==s[k]) ++k;
   	pi[i]=k;
   }
}

int main(void)
{
 ifstream cin("strmatch.in");
 ofstream cout("strmatch.out");
 getline(cin,s);
 getline(cin,s2);
 int length=s.size();
 s+='#'+s2;
 kmp();
 for (i=0;i<s.size();++i)	
   if (pi[i]==length) 
     V.push_back(i-2*length);
 cout<<V.size()<<"\n";
 for (i=0;i<=min(V.size(),1000);++i)
   	cout<<V[i]<<" ";   
 return 0;
}