#include <bits/stdc++.h>
#define MEM(a,b) memset((a),(b),sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define In freopen("In.txt", "r", stdin);
#define Out freopen("out.txt", "w", stdout);

/*
Naive pattern searching is a slow
process/algorithm of searching substring in an substring
Use KMP/Aho-korasik for large
dataset. Time complexity is high here.
*/

using namespace std;

void searchPattern(string x,string p)
{
    int l1 = x.length();
    int l2 = p.length();
    int i,j;
    for(i=0; i<l1-l2; i++)
    {
        string tmp = x.substr(i,l2);
        if(p.compare(tmp)==0)
            cout << i << endl;
    }
    return;
}

int main()
{
    string txt = "AABAACAADAABAAABAA";
    string ptr = "AABA";
    searchPattern(txt,ptr);
    searchPattern("AAAAAAA","A");
    return 0;
}