#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <climits>
#include <unordered_map>

#define NMAX 2000003

using namespace std;

vector<int> sol;
char cuv1[NMAX],cuv2[NMAX];

FILE *fin,*fout;



int main()
{
    fin=fopen("strmatch.in","r");
    fout=fopen("strmatch.out","w");
    fgets(cuv1,NMAX,fin);
    fgets(cuv2,NMAX,fin);

    cuv1[strlen(cuv1)-1]='\0';//sa evit spatiul de la final

    char* poz=strstr(cuv2,cuv1);
    sol.push_back(strlen(cuv2)-strlen(poz));

    while(poz!=NULL)
    {
        poz=strstr(poz+1,cuv1);
        if(poz!=NULL)
        {
            sol.push_back(strlen(cuv2)-strlen(poz));
        }
    }
    fprintf(fout,"%lu\n",sol.size());
    for(int i=0; i<sol.size(); i++)
    {
        fprintf(fout,"%d ",sol[i]);
        if(i>1000)
        {
            break;
        }
    }
    return 0;
}