#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second

const long double PI = acos(-1);

class RabinKarp
{  
   const static int BASE = 256;
   const static int DEFAULT_MOD = 1000000007;

   const string pattern;
   long long key;
   long long p;

public:
   RabinKarp(const string& pattern) : pattern(pattern)
   {
      key = 0;
      p = 1;
      for (auto i : pattern) 
      {
         if (key != 0) p = (p * BASE) % DEFAULT_MOD;
         key = (key * BASE + i) % DEFAULT_MOD;
      }
   }
   
   vector<int> run(const string& text, bool check = true) const
   {
      vector<int> idxs;
      long long txtkey = 0;
      for (int i = 0; i < pattern.size() - 1; i++) txtkey = (txtkey * BASE + text[i]) % DEFAULT_MOD;

      for (int i = pattern.size() - 1; i < text.size(); i++)
      {
         txtkey = (txtkey * BASE + text[i]) % DEFAULT_MOD;
         if (key == txtkey)
         {
            bool same = true;
            for (int k = 0; k < pattern.size() && same && check; k++)
               if (pattern[k] != text[i - pattern.size() + 1 + k]) same = false;
            if (same) idxs.push_back(i - pattern.size() + 1);
         }
         txtkey = (((txtkey - text[i - (pattern.size() - 1)] * p) % MOD + MOD) % MOD);
      }
      return idxs;
   }
};


int main()
{
   ios::sync_with_stdio(false);

   freopen("strmatch.in", "r", stdin);
   freopen("strmatch.out", "w", stdout);
   
   string s, t;
   cin >> s;
   cin >> t;
   RabinKarp rk(s);
   vector<int> v = rk.run(t);
   cout << v.size() << '\n';
   for (int i=0; i<min(1000, (int) v.size()); i++)
      cout<<v[i]<< " ";
   return 0;
}