/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<unsigned int,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<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#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 int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  4398042316799LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 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");

vector<int> cs;
char a[N],b[N];
int n,m,z[N],l,r,lcp,sol;

int main ()
{
    f>>(a+1);
    n=strlen(a+1);
    FOR(i,2,n)
    {
        if(i<=r)
            z[i]=min(z[i-l+1],r-i+1);
        for(;i+z[i]<=n&&a[i+z[i]]==a[z[i]+1];++z[i]);
        l=i;
        r=i+z[i]-1;
    }

    f>>(b+1);
    m=strlen(b+1);
    l=r=0;
    FOR(i,1,m)
    {
        if(i<=r)
            lcp=min(z[i-l+1],r-i+1);
        else
            lcp=0;
        for(;i+lcp<=m&&lcp<n&&b[i+lcp]==a[lcp+1];++lcp);
        l=i;
        r=i+lcp-1;
        if(lcp==n)
        {
            ++sol;
            if(sol<=1000)
            cs.pb(i-1);
        }
    }
    g<<sol<<"\n";
    FIT(it,cs)
    g<<*it<<" ";
    return 0;
}