#include <iostream>
#include <cmath>
#include <math.h>
#include <vector>
#include <set>
#include <unordered_set>
#include <tuple>
#include <map>
#include <unordered_map>
#include <string>
#include <string.h>
#include <utility>
#include <algorithm>
#include <queue>
#include <deque>
#include <iterator>
#include <stdlib.h>
#include <cstdlib>
#include <bitset>

using namespace std;

typedef long long ll;

inline ll subhash(vector<ll>& hash, ll l, ll r, ll mod, vector<ll>& pw) {
    ll big = hash[r];
    ll small = 0;
    if (l != 0) {
        small = (hash[l - 1] * pw[r - l + 1]) % mod;
    }
    return (big - small + mod) % mod;
}

int main() {
    const ll mod = 2e9 + 63;
    const ll p = 173;
    string entry; cin >> entry;
    string dima; cin >> dima;
    entry += entry;
    ll kol = entry.size();
    ll dimKol = dima.size();
    vector <ll> hash(kol);
    vector<ll> dimHash(dimKol);
    vector <ll> pw(50000);

    hash[0] = entry[0];
    for (int i = 1; i < kol; ++i) {
        hash[i] = ((hash[i - 1] * p) + entry[i]) % mod;
    }

    dimHash[0] = dima[0];
    for (int i = 1; i < kol; ++i) {
        dimHash[i] = ((dimHash[i - 1] * p) + dima[i]) % mod;
    }

    pw[0] = 1;
    for (int i = 1; i < 50000; ++i) {
        pw[i] = (pw[i - 1] * p) % mod;
    }

    ll dimHashAns = dimHash[dimKol - 1];

    for (int i = 1; i < dimKol + 1; ++i) {
        ll ans = subhash(hash, i, i + dimKol - 1, mod, pw);
        cout << ans << " " << dimHashAns << endl;
        if (dimHashAns == ans) {
            cout << i;
            exit(0);
        }
    }

    cout << -1;
}