#include <iostream>

 #include <map>

 #include <vector>

 #include <algorithm>

 #include <string>

 using namespace std;

 int main()

 {

     string pattern = "ABCABC";

     string s = "ABCABCABCABCBCABC";

     vector<int> lps(pattern.size());

     int len = ;

     int i = ;

     lps[] = ;

     while (i < pattern.size()) {

         if (pattern[i] == pattern[len]) {

             len++;

             lps[i] = len;

             i++;

         }

         else if (len != ) len = lps[len-];

         else {

             lps[i] = ;

             i++;

         }

     }

     //for (int i = 0; i < pattern.size(); i++) cout << lps[i] << endl;

     i = ;

     int j = ;

     while (i < s.size()) {

         if (s[i] == pattern[j]) {

             j++;

             i++;

         }

         if (j == pattern.size()) {

             cout << i - j << endl;

             j = lps[j-];

         }

         else if (pattern[j] != s[i]) {

             if (j != ) j = lps[j-];

             else i++;

         }

     }

     return ;

 }