#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2000 + 10;
int l, m, x, y, t;
int a[N], k[N];
char s[N];
bool Find() {
    for(int i=1; i<l; i++)
        for(int j=i+1; j<=l; j++)
            if((t - k[i]*a[i] - k[j]*a[j] + k[i]*a[j] + k[j]*a[i]) % m == 0) {
                x = i, y = j;
                return true;
            }
    return false;
}
int main() {
    freopen("patchouli.in", "r", stdin);
    freopen("patchouli.out", "w", stdout);
    scanf("%s\n", s);
    scanf("%d", &m);
    l = strlen(s);
    for(int i=1; i<=l; i++)
        a[i] = s[i-1] - 'A';
    k[l] = 1;
    for(int i=l-1; i>0; i--)
        k[i] = (k[i+1] * 26) % m;
    for(int i=l; i>0; i--)
        t += k[i] * a[i];
    if(t % m) if(!Find()) x = y = -1;
    printf("%d %d\n", x, y);
    return 0;
}