#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1000 + 10;
const int INF = 0x7fffff;
int n, m, x;
char s[N];
int f[N][50], g[N][N];
int main() {
    freopen("chars.in", "r", stdin);
    freopen("chars.out", "w", stdout);
    scanf("%s\n", s);
    scanf("%d", &m);
    n = strlen(s);
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            f[i][j] = INF;
    for(int i=0; i<n; i++)
        f[i][x = (x*10 + s[i]-'0') % m] = 0;
    for(int i=0; i<n; i++) {
        x = 0;
        for(int j=i; j<n; j++)
            g[i][j] = x = (x*10 + s[j]-'0') % m;
    }
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++) if(f[i][j] < INF)
            for(int k=i+1; k<n; k++) {
                x = (j*g[i+1][k]) % m;
                f[k][x] = min(f[k][x], f[i][j]+1);
            }
    for(int i=0; i<m; i++) if(f[n-1][i] < INF) {
        printf("%d %d ", i, f[n-1][i]);
        break;
    }
    for(int i=m-1; i>=0; i--) if(f[n-1][i] < INF) {
        printf("%d %d\n", i, f[n-1][i]);
        break;
    }
    return 0;
}