#include <iostream>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <string>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <iomanip>

using namespace std;

#define ll long long

// Global variables
string a, b;

void ReadData() {
    cin >> a >> b;
    if (a.size() > b.size())
    {
       cout << "0";
       exit(0);
    }
    
}

void Solve() {
    int i = 0;
    int count = 0;
    vector<int> result;

    while( i + a.size() <= b.size()){
        if(a[0] == b[i]){
            //check if subsequence
            bool matched = true;
            for(int j = 0; j < a.size(); j ++){
                int index = i + j;
                if (a[j] != b[index])
                {
                    matched = false;
                    break;
                }     
            }
            if(matched){
                count++;
                result.push_back(i);
            }
        }
        i++;
    }

    cout << count << "\n";
    for(int val : result)
        cout << val << " ";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    int t = 1;
    // cin >> t; // Uncomment for multiple test cases
    while (t--) {
        ReadData();
        Solve();   
    }
    return 0;
}