Help me in solving N3 problem

help
,
1

My issue

I am not not able to understand the problem, like what we need to do?

My code

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

int main(){
    int t;
    cin>>t;
    while(t--){
        int n,k,l;
        cin>>n>>k>>l;
        vector<string>v;
        for(int i=0;i<n;i++){
            string s;
            cin>>s;
            v.push_back(s);
        }
    }
    return 0;
}

Problem Link: N3 Problem - CodeChef

2

@komal_1673
U have to print the minimum size of string having at least k substring from the given N strings like abc,bcf,xyz and k=2 then abcf will the smallest size of string that have 2 substring abc,bcf in set of n strings.