#include<iostream>
using namespace std;


int S (int *A, int n) {
    int i = 0, cont = 0;
    bool giusto = false;


    while (!giusto && A[i] != -2){

        if (A[i] == -1){

            cont++;

            if (cont == n){
                giusto = true;
            }
        }

        i++;
    }

    if(!giusto || A[i] == -2) i = -2;

    return i;
}



int main(){
   int X[400];

   cin >> X[0];

   for(int i=1; i<400 && X[i-1]!=-2; i++)
   cin >> X[i];

    int n;
    cin >> n;

    cout<<"start"<<endl;
    int b = S(X,n);

    if(b == -2)
     cout<<"sottosequenza "<<n<<" non presente"<<endl;
    else
     cout<<"inizio sottosequenza "<<n<<" indice="<<b<<endl;

    cout<<"end"<<endl;
 }