#include <bits/stdc++.h>
#define NMAX 2000000
#define inFile "strmatch.in"
#define outFile "strmatch.out"

using namespace std;
char a[NMAX],b[NMAX];
int i,j;
queue<int> rez;
void pass() {}
int main()
{
    freopen(inFile, "r", stdin);
    freopen(outFile, "w", stdout);

    scanf("%s", &a);
    scanf("%s", &b);
    bool isGood=false;
    int pos,nextStart;
    i=0;
    while (i<strlen(b))
    {
        if (a[0] == b[i])
        {
            nextStart = 0;
            isGood = true;
            pos=i;
            i++;
            j = 1;
            while (j < strlen(a))
            {
                pass();
                if (nextStart == 0 && b[i] == a[0])
                {
                    nextStart = i;
                }
                if (b[i]!=a[j])
                {
                    isGood=false;
                    break;
                }
                i++;
                j++;
            }
            if (isGood)
            {
                rez.push(pos);
            }
            if (nextStart != 0)
            {
                i = nextStart;
                continue;
            }
        }
        i++;
    }
    printf("%d \n", rez.size());
    for (int i = 0; i < 1000 && !rez.empty(); i++)
    {
        printf("%d ", rez.front());
        rez.pop();
    }

    fclose(stdin);
    fclose(stdout);
    return 0;
}