#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define l long
#define d double
#define in int
#define si(x) scanf('%d', &x)
#define sl(x) scanf('%lld', &x)
#define ss(s) scanf('%s', s) 
#define pi(x) printf('%d', x)
#define pl(x) printf('%lld', x)
#define ps(s) printf('%s', s) 
#define pb push_back 
#define mp make_pair 
#define F first 
#define S second 
#define all(x) x.begin(), x.end() 
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x)) 
typedef pair<int, int> pii; 
typedef pair<ll, ll> pl; 
typedef vector<int> vi; 
typedef vector<ll> vl; 
#define modulo 1000000007
#define FOR(i,a,b) for(int i=a;i<=b;i++)
typedef vector<pii> vpii;
#define dim 2000005
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

void solve(){
    
}

int v[1001],p[dim];
int k,t;

int main() 
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    string a,b;
    fin>>a;
    fin>>b;
    int n = a.size();
    int m = b.size();
    for(int i = 2;i<n;i++)
    {
        while(k && a[k+1] != a[i])
            k = p[k];
        if(a[k+1] == a[k])
            k++;
        p[i] = k;
    }
    int i;
    for(k = 0,i=1;i<m;i++) 
    {
        while(k && a[k+1] != b[i])
            k=p[k];
        if(a[k+1] == b[i])
            k++;
        if(k == n-1 && a[0] == b[i-k])
        {
            if(t < 1000)
                v[t] = i-n+1;
            t++;
        }
    }

    if(t>1000)
        t = 1000;
    fout<<t<<'\n';
    for(i=0;i<t;i++)
        cout<<v[i]<<" ";
    return 0;
}