#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  for(int x, y; cin >> x >> y && (x && y);) {
    unordered_map<int, int> mp;
    int cnt = 0;
    while(mp.find(x % y) == mp.end()) {
      if(x % y == 0) {
        cout << cnt << " 0" << endl;
        goto exit;
      }
      mp[x % y] = cnt ++;
      x %= y;
      x *= 10;
    }
    cout << mp[x % y] << " " << cnt - mp[x % y] << endl;
    exit:;
  }
  
  return 0;
}