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

int f[2][220][220], s[2][220][220];

const int mod = 1000000007;

int main() {
    int n, m, k_;
    char a[1010], b[220];
    cin >> n >> m >> k_;

    //  cin>>a>>b;
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    for (int i = 1; i <= m; i++)
        cin >> b[i];

    s[0][0][0] = 1;

    for (int i = 1; i <= n; i++) {
        s[i % 2][0][0] = 1;

        for (int j = 1; j <= m; j++) {
            for (int k = 1; k <= min(k_, j); k++) {
                if (a[i] == b[j]) {
                    f[i % 2][j][k] = (f[(i - 1) % 2][j - 1][k] + s[(i - 1) % 2][j - 1][k - 1]) % mod;
                    s[i % 2][j][k] = (s[(i - 1) % 2][j][k] + f[i % 2][j][k]) % mod;
                } else {
                    s[i % 2][j][k] = s[(i - 1) % 2][j][k];
                    f[i % 2][j][k] = 0;
                }
            }
        }
    }

    cout << s[n % 2][m][k_];
}