#include <cstdint>
#include <fstream>
#include <string>
#include <vector>

using namespace std;

class Result {
public:
    void AddMatch(int pos);

    friend ostream& operator<<(ostream& os, const Result& res);

private:
    vector<int> matches_;
    int match_count_ = 0;
};

void Result::AddMatch(int pos) {
    if (matches_.size() < 1000) {
        matches_.push_back(pos);
    }
    match_count_ += 1;
}

ostream& operator<<(ostream& os, const Result& res) {
    os << res.match_count_ << "\n";
    for (const auto& pos : res.matches_) {
        os << pos << " ";
    }
    os << "\n";
    return os;
}

constexpr int64_t kBase = 103;
constexpr int64_t kMod = 1e9 + 7;

int64_t Power(int64_t base, int64_t exp) {
    if (exp == 0) {
        return 1;
    } else if (exp == 1) {
        return base % kMod;
    }

    if (exp % 2 == 1) {
        return (base % kMod * Power(base, exp / 2)) % kMod;
    }

    auto root = Power(base, exp / 2);
    return (root * root) % kMod;
}

int64_t Hash(const string& str) {
    int64_t hash = 0;
    for (const auto& ch : str) {
        hash = (hash * kBase + (ch - 'A')) % kMod;
    }
    return hash;
}

Result Solve(const string& needle, const string& haystack) {
    int64_t needle_hash = Hash(needle);
    int64_t curr_hash = 0;
    int64_t pow = Power(kBase, needle.size());
    Result res;

    for (size_t i = 0; i < haystack.size(); i += 1) {
        curr_hash = (curr_hash * kBase + (haystack[i] - 'A')) % kMod;
        if (i + 1 < needle.size()) {
            continue;
        }

        auto l = i + 1 - needle.size();
        if (curr_hash == needle_hash &&
            needle == haystack.substr(l, needle.size())) {
            res.AddMatch(l);
        }
        curr_hash = (curr_hash - pow * (haystack[l] - 'A')) % kMod;
    }
    return res;
}

int main() {
    ifstream fin("strmatch.in");
    ofstream fout("strmatch.out");

    string needle, haystack;
    getline(fin, needle);
    getline(fin, haystack);

    auto res = Solve(needle, haystack);
    fout << res << "\n";

    return 0;
}