/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#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<long long,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 long long
#define ui 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 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 s[N],r[N];
int n,sol,m;
ui po[N];
int main ()
{
    f>>(s+1);
    n=strlen(s+1);
    ui ka=0;
    FOR(i,1,n)
    ka=ka*73+s[i];

    f>>(r+1);
    m=strlen(r+1);
    if(n>m)
    {
        g<<"0";
        return 0;
    }
    ui kb=0;
    FOR(i,1,n)
    kb=kb*73+r[i];
    if(ka==kb)
    {
        sol++;
        cs.pb(0);
    }
    po[0]=1;
    FOR(i,1,n)
    po[i]=po[i-1]*73;
    FOR(i,n+1,m)
    {
        kb-=po[n-1]*r[i-n];
        kb=kb*73+r[i];
        if(ka==kb)
        {
            sol++;
            if(sol>1000)
                continue;
            cs.pb(i-n);
        }
    }
    g<<sol<<"\n";
    FIT(it,cs)
    g<<*it<<" ";
    return 0;
}