#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
    int p, q;
    
    while(cin >> p >> q && (p || q))
    {
        int f = 0, x = -1;
        vint num;
        set<pint> dic;
        
        p = p % q * 10;
        
        do 
        {
            if(x != -1) dic.insert(set<pint>::value_type(mp(x, p)));
            
            x = p / q;
            p = p % q * 10;
            
            num.push_back(x);
        }
        while (!(x != 0 && dic.find(mp(x, p)) != dic.end()) && p != 0);
        
        
        int brank = 0;
        int tmp = 0;
        rep(i, num.size() - 1)
        {
            if(num[i] == 0) brank++;
            else    break;
        }
        rep(i, num.size() - 1)
        {
            if(num[i] == 0) tmp++;
            else tmp = 0;
        }
        chmin(brank, tmp);
        
        if(p)
        {
            bool r = false;
            rep(i, num.size() - 1 - brank)
                cout << num[i] << (i == num.size() - 2 - brank ? "\n" : "");
            rep(i, num.size() - 1 - brank)
            {
                r |= num[max(0, i + brank)] == x;
                cout << (r ? "^" : " ") << (i == num.size() - 2 - brank ? "\n" : "");
            }
        }
        else rep(i, num.size()) cout << num[i] << (i == num.size() - 1 ? "\n" : "");
    }
}