#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int M=;

int len,id,p[M],ans,pos,k;

char T[],s[M];

int main()

{

    while(~scanf("%s %s",T,s)){

        memset(p,,sizeof(p));

        len=strlen(s); ans=; id=; pos=; k=T[]-'a';

        for(int i=len;i>=;i--) s[i*+]=s[i],s[i*+]='#';

        s[]='&'; len=len*+;

        for(int i=;i<=len;i++){

            if(id+p[id]>i) p[i]=min(p[id*-i],id+p[id]-i);

            else p[i]=;

            while(s[i-p[i]]==s[i+p[i]]) p[i]++;

            if(p[i]>ans) ans=p[i],pos=i;

            if(id+p[id]<i+p[i]) id=i;

        }

        int l=(pos-p[pos]+)/-,r=(pos+p[pos]-)/-;

        if((r-l+)<){printf("No solution!\n"); continue;}

        printf("%d %d\n",l,r);

        for(int i=pos-p[pos]+;i<=pos+p[pos]-;i+=) printf("%c",(s[i]-'a'-k+)%+'a'); printf("\n");

    }

    return ;

}