#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "strmatch";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 2000005;
const int oo = (1<<31)-1;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

int N, M, Prefix[MAXN];
char A[MAXN], B[MAXN];
vector<int> Ans;

inline void BuildPrefix() {
    Prefix[1] = 0;
    int K = 0;
    for(int i = 2 ; i <= N ; ++ i) {
        while(K > 0 && A[K+1] != A[i])
            K = Prefix[K];
        if(A[K + 1] == A[i])
            ++ K;
        Prefix[i] = K;
    }
}

inline void KMP() {
    int K = 0;
    for(int i = 1 ; i <= M ; ++ i) {
        while(K > 0 && A[K+1] != B[i])
            K = Prefix[K];
        if(A[K + 1] == B[i])
            ++ K;
        if(K == N)
            Ans.push_back(i - K);
    }

}

int main() {
    cin >> (A + 1);
    cin >> (B + 1);
    N = strlen(A + 1);
    M = strlen(B + 1);
    BuildPrefix();
    KMP();
    cout << min(Ans.size(), 1000) << '\n';
    for(int i = 0 ; i < min(Ans.size(), 1000) ; ++ i)
        cout << Ans[i] << ' ';
    cout << '\n';
    cin.close();
    cout.close();
    return 0;
}