/*
TASK:context
LANG:C++
*/

#include<cstdio>
#include<cctype>
#include<string>
using namespace std;

char a[56], b[65536];
int la, lb, bega, begb;
int check(int beg)
{
	for(int i=0; i<la; i++)
	{
		if(a[bega+i]!=tolower(b[beg+i])) return 0;
	}
	return 1;
}
		
int main()
{
	int n;
	scanf("%d", &n); gets(a);
	gets(a);
	gets(b);
	puts(a);
	bega=0;
	while(a[bega]==' ') bega++;
	begb=0;
	while(b[begb]==' ') begb++;
	int i,j;
	la=strlen(a), lb=strlen(b);
	int prev=0, left=(lb-begb)-(la-bega);
	for(int i=0; i<la; i++) a[i]=tolower(a[i]);
	printf("\n");
	for(i=begb; i<lb; i++)
	{
		if(check(i))
		{
			printf("%d  ", i);
			int pr=n, nt=n;
			if(pr>prev){nt+=pr-prev; pr=prev;}
			else if(nt>left){pr+=nt-left; nt=left;}
			if(nt>left)nt=left;
			int end=i+la-bega+nt;
			printf("%d %d\n", i-pr, end);
			//for(j=i-pr; j<=end; i++) printf("%c", b[j]);
			printf("\n");
		}
	}
	return 0;
}
