#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

const int b1=13,mod1=1046527;
const int b2=17,mod2=939391;
const int N=2000001;

vector<int> a[mod1];
vector<int> b[mod2];

char s1[N],s2[N];

int m1,m2,sl;

int sol[1001];

void insert(int i,int x,int bz)
{
    if(bz==0)
        a[x].push_back(i);
    else b[x].push_back(i);
}

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    gets(s1);
    for(sl=0;s1[sl];sl++);

    int sl_c=sl-1;

    m1=m2=0;
    int bamp=1;

    while(sl_c>=0)
    {
        m1=(m1+(s1[sl_c]-65)*bamp)%mod1;
        bamp=bamp*b1%mod1;
        sl_c--;
    }

    bamp=1; sl_c=sl-1;

    while(sl_c>=0)
    {
        m2=(m2+(s1[sl_c]-65)*bamp)%mod1;
        bamp=bamp*b2%mod1;
        sl_c--;
    }

    gets(s2);

    int i;
    bamp=1;
    int sum1=0;
    for(i=sl-1;i>=0;--i)
    {
        sum1=(sum1+(s2[i]-65)*bamp)%mod1;
        bamp=bamp*b1%mod1;
    }
    int bamp_a=bamp;
    insert(i,sum1,0);

    printf("%d\n",sl);
    bamp=1;
    int sum2=0;
    for(i=sl-1;i>=0;--i)
    {
        printf("%c",s2[i]);
        sum2=(sum2+(s2[i]-65)*bamp)%mod2;
        printf(" %d\n",sum2);
        bamp*=b2;
    }
    int bamp_b=bamp;
    insert(i,sum2,1);

    /*for(i=sl;s2[i];++i)
    {
        sum1=(sum1*b1)%mod1;
        sum1=sum1-(s2[i-sl]*bamp_a)%mod1;
        sum1=sum1+(s2[i])%mod1;
        insert(i,sum1,0);

        sum2=(sum2*b2)%mod2;
        sum2=sum2-(s2[i-sl]*bamp_b)%mod2;
        sum2=sum2+(s2[i])%mod2;
        insert(i,sum2,1);
    }*/
    printf("%d",sum2);
    //printf("%d\n",sl);
    return 0;
}