KMP

const int maxn = 1e5 + 5;
int n, m;  // n 主串长度， m模式串长度
string a, b;  // a 主串， b 模式串, 下标从零开始
int _next[maxn], nextval[maxn];
void get_next() {
    int i = 0, j;
    j = _next[0] = -1;
    while (i < m)
    {
        if (-1 == j || b[i] == b[j])
            _next[++i] = ++j;
        else
            j = _next[j];
    }
}

void get_nextval() {
    int i = 0, j;
    j = nextval[0] = -1;
    while (i < m) {
        if (-1 == j || b[i] == b[j]) {
            ++i, ++j;
            nextval[i] = (b[i] != b[j]) ? j : nextval[j];
        }
        else {
            j = nextval[j];
        }
    }
}

int kmp_index(int pos) {
    // 求模式串在主串 pos位置 字符之后的位置
    int i = pos, j = 0;
    while (i < n && j < m) {
        if (-1 == j || a[i] == b[j]) {
            ++i, ++j;
        }
        else {
            j = nextval[j];
        }
    }
    if (j >= m) return i - m;
    else return -1;
}

int kmp_count(int pos) {
    // 求模式串在主串中出现了几次
    int i = pos, j = 0;
    int ans = 0;
    while (i < n) {
        if (-1 == j || a[i] == b[j]) {
            ++i, ++j;
            if (j >= m) {
                ++ans;
                //q.push(i);
                j = nextval[j];
            }
        }
        else
            j = nextval[j];
    }
    return ans;
}

int main()
{
    cin >> a >> b;
    n = a.size(); m = b.size();
    get_next();
    get_nextval();
    int Index = kmp_index(0);
    int Count = kmp_count(0);
    cout << Index << ' ' << Count << endl;
    return 0;
}