9

#include <iostream>
#include <string>

using namespace std;

int find(string s, string t) {
    int i = -1;
    int j = 0;
    int n = s.size();
    int m = t.size();
    do {
        j = 0;
        i ++;
        while (j < m && s[i + j] == t[j]) j++;
    } while (j < m && i < n - m);
    if (j == m) return i;
    return -1;
}

int main() {
    string s, t;
    cin >> s >> t;
    cout << find(s, t) << endl;
    return 0;
}