#include <bits/stdc++.h>
using namespace std;

// Renamed 'array' to 'printArray' to avoid conflict with std::array
// Passed the vector by constant reference to avoid unnecessary copying
void rest(int n, const vector<int>& a,int t) {
  if(n==0){cout<< -1;return;}
  
 if (a[n-1] == t) {
        cout << "f  " << n-1 << endl;
    }
    
    // Always recursively call to check the rest of the elements
    rest(n-1, a, t);
    
    if (a[n-1] == t) {
        cout << "lcc " << n-1 << endl;
    }
}

int main() {
    int n = 5;
    vector<int> a = {1, 2, 5, 7, 5};
    int t = 5;
    rest(n, a ,  t);
    
    return 0;
}