#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define cin fin
#define cout fout

ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");

const int NMAX=2e6+5;

string a;
string b;

int p[NMAX];

vector<int>v;

void kmp(int n)
{
    int i,k=0;
    for(i=1;i<n;i++)
    {
        while(a[i]!=a[k] && k>0)
            k=p[k-1];
        if(a[i]==a[k])
            k++;
        p[i]=k;
    }
}

int main()
{
    int n,m,i,j,k=0;
    cin>>a>>b;
    n=a.size();
    m=b.size();
    kmp(n);
    for(i=1;i<m;i++)
    {
        while(b[i]!=a[k] && k>0)
            k=p[k-1];
        if(b[i]==a[k])
            k++;
        if(k==n)
            v.push_back(i-n+1);
    }
    cout<<v.size()<<"\n";
    int debuff=0;
    for(auto i:v)
    {
        debuff++;
        cout<<i<<" ";
        if(debuff==1000)
            break;
    }
    return 0;
}