/*
potrivirea sirurilor infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>

using namespace std;

#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second

#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))

#define IN_FILE "strmatch.in"
#define OUT_FILE "strmatch.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);

//variables
string a, b;
WI x;
int maxi=0;
VI y;
//other functions
void reading()
{
	f >> a >> b;
	f.close();
}
void solving()
{
	x.RS(a.length()+1,VI(b.length()+1));
	FOR(i,1, a.length())
	{
		FOR(j,1, b.length())
		{
			if (a[i-1] == b[j-1])
			{
				x[i][j] = x[i - 1][j - 1] + 1;
				if (maxi < x[i][j])
				{
					maxi = x[i][j]; 
					y.clear();
					y.push_back(j);
				}
				else if (maxi == x[i][j])
				{
					y.push_back(j);
				}
			}
			else
			{
				x[i][j] = 1;
			}
		}
	}
}
void write_data()
{
	g << y.size() << "\n";
	FORN(i, y.size())
	{
		g << y[i] - maxi << " ";
	}
}
int main()
{
	reading();
	solving();
	write_data();
}