#include<iostream>
#include<stack>
#include<deque>
#include<queue>
#include<string>
#include<vector>
#include<algorithm>
#include<fstream>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int NMAX = 2000005;
string A,B;
int P[NMAX],sol[1005];

void prefix()
{

    int k = 0;
    P[0] = 0;
    for(int i = 1 ; i < A.size() ; ++i){

        while(k > 0 && A[k] != A[i])
            k = P[k];
        if(A[k] == A[i])
            ++k;
        P[i] = k;
    }
}

int main()
{

    in>>A>>B;
    prefix();
    int k = 0,n = 0;
    for(int i = 0 ; i < B.size() ; ++i){
        while(k > 0 && A[k] != B[i])
            k = P[k];
        if(A[k] == B[i])
            ++k;
        if(k == A.size()){
            if(n <= 1000)
                sol[++n] = i - A.size()+1;
            k = P[A.size()-1];
        }
    }
    out<<n<<"\n";
    for(int i = 1 ; i <= n ; ++i)
        out<<sol[i]<<" ";
    return 0;
}