#include <algorithm>
#include <iostream>
using namespace std;
string b[205];
bool cmpsiz(string x, string y) { return x.size() > y.size(); }
int main() {
    freopen("string.in", "r", stdin);
    freopen("string.out", "w", stdout);
    int n, m, k;
    string a;
    cin >> n >> m >> k;
    cin >> a;
    for (int i = 1; i <= m; i++) {
        cin >> b[i];
    }
    if (k == 1) {
        sort(b + 1, b + 1 + m, cmpsiz);
        for (int i = 1; i <= m; i++) {
            if (a.find(b[i])) {
                cout << a.size() - b[i].size();
                return 0;
            }
        }
    }
}