#include <fstream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;
using pii = pair<int,int>;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
const int base = 257;
const int mod = 1e9 + 7;
const int mod2 = 1e9 + 21;
string a , b;
long long pw = 1;
vector <int> ans;
int cnt;
signed main()
{
    cin >> a >> b;
    for(int i = 1 ; i < a.size() ; ++i) pw = (pw * base) %mod;
    long long h = 0 , h2 = 0 , h3 = 0 , h4 = 0;
    for(int i = 0 ; i < a.size() ; ++i)
    {
        h = (h * base %mod + a[i])%mod;
        h2 = (h2 * base %mod + b[i])%mod;
        h3 = (h3 * base %mod2 + a[i])%mod2;
        h4 = (h4 * base %mod2 + b[i])%mod2;
    }
    cout << h << '\n';
    for(int i = 0 ;; ++i)
    {
        if(h == h2 && h3 == h4)
        {
            ++cnt;
            if(ans.size() < 1000) ans.push_back(i);
        }
        h2 -= (pw*b[i])%mod;
        h4 -= (pw*b[i])%mod2;
        while(h2 < 0) h2 += mod;
        while(h4 < 0) h2 += mod;
        if(i + a.size() < b.size())
        {
            h2 = (h2*base%mod + b[i + a.size()])%mod;
            h4 = (h4*base%mod2 + b[i + a.size()])%mod2;
        }
        else break;
    }
    cout << cnt << '\n';
    for(auto it : ans) cout << it << ' ';
    return 0;
}