/***************************************************
 * Alex Palcuie
 * Romania - 2015
 * alex [dot] palcuie [at] gmail [dot] com
 * http://blog.palcu.ro/
****************************************************/

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

// Defines
#define NAME(n) #n
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define F first 
#define S second 
#define pb push_back
#define sz size()
#define mp make_pair
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

// Helpers
template <typename T> inline void dbv(const T * v, const char * name, int n){
    fprintf(stderr, "=== %s ===\n", name);
    for(int i=0; i<n; i++)
        cerr << v[i] << " ";
    cerr << '\n';
}
template<typename T> void dbw(const std::vector<T>& t, const char * name){
    fprintf(stderr, "=== %s ===\n", name);
    unsigned n = t.size();
    for(typename std::vector<T>::size_type i=0; i<n; ++i)
        std::cerr << t[i] << ' ';
    cerr << '\n';
}

// Structs

// Constants
const int N = 1<<10;
const int INF = 0x3f3f3f3f;

// Globals

// Functions
int main(){
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    string s;
    getline(cin, s);

    vector<int> prefix(s.size(), 0);
    int pos = 0;
    for (int i=1; i<s.size(); i++) {
        if (s[i] == s[pos]) {
            pos++;
            prefix[i] = pos;
        } else {
            pos = 0;
        }
    }


    string text = "CABBCABABAB";
    getline(cin, text);

    int i=0, j=0;
    vector<int> res;
    while (i < text.size()) {
        while (j < s.size() && i < text.size() && s[j] == text[i]){
            i++; j++;
        }

        if (j == s.size()) {
            res.push_back(i - s.size());
            j--; i--;
        }

        j = prefix[j];
        i++;
    }

    cout << res.size() << endl;
    for (auto x : res)
        cout << x << " ";
    
    return 0;
}