#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 #define int long long

 #define maxn 1000000+10

 #define INF 9187201950435737471

 #define rep(i,s,e) for(register int i=s;i<=e;++i)

 #define dwn(i,s,e) for(register int i=s;i>=e;--i)

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

     for(; !isdigit(c); c=getchar()) if(c=='-') f=;

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(int x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int j,len1,len2;

 char A[maxn],B[maxn];

 int p[maxn];

 void init()

 {

     j=;

     p[]=;

     rep(i,,len2)

     {

         while(j>&&B[i]!=B[j+]) j=p[j];

         if(B[i]==B[j+]) ++j;

         p[i]=j;

     }

 }

 signed main()

 {

     scanf("%s",A+);

     scanf("%s",B+);

     len1=strlen(A+);

     len2=strlen(B+);

     init();

     j=;

     rep(i,,len1)

     {

         while(j>&&A[i]!=B[j+]) j=p[j];

         if(A[i]==B[j+]) ++j;

         if(j==len2)

         {

             write(i-len2+);

             putchar('\n');

             j=p[j];

         }

     }

     rep(i,,len2) write(p[i]),putchar(' ');

     return ;

 }