#include <bits/stdc++.h>

using namespace std;

int main()
{
   ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    string a;
    string b;
    f>>a>>b;
    vector<int> v;
   int rep=0, gasit,n,m;
   n=b.size();
   m=a.size();
   if(n>m)
    n=n-(m-1);
    for(int i=0; i<n; ++i)
    {
        if(b[i]==a[0])
            {
                gasit=1;
                for(int j=1; j<m; ++j)
                {
                    if(b[i+j]!=a[j])
                        {
                            gasit=0;
                            break;
                        }
                }
                if(gasit==1)
                    {
                        rep++;
                        v.push_back(i);
                    }
            }
    }
    g<<rep<<'\n';
    sort(v.begin(),v.end());
    if(rep>=1000) rep=1000;
    for(int i=0; i<=rep-1; i++)
        g<<v[i]<<" ";

           return 0;
}