#include<vector>
#include<map>
#include<climits>
#include<set>
#include<queue>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<string>
#include<bitset>
#include<cstring>
#include<list>
using namespace std;
typedef vector<int>VI;
typedef vector<VI>VVI;
typedef vector<string>VS;
typedef pair<int,int>PII;
typedef long long LL;
typedef pair<LL,LL>PLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PB push_back
#define EACH(i,c) for(typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define F first
#define S second

int main(){
    int p,q;
    while(cin>>p>>q){
        p*=10;
        map<int,int>M;
        vector<int>V;
        int start=-1;
        while(true){
            if(M[p]!=0){
                start=M[p];
                break;
            }
            V.PB(p/q);
            M[p]=V.size();
            if(p%q==0)break;
            p%=q;
            p*=10;
        }
        start--;
        REP(i,V.size())cout<<V[i];cout<<endl;
        if(start==-1)continue;
        REP(i,start)cout<<" ";
        FOR(i,start,V.size())cout<<"^";
        cout<<endl;
    }

    return 0;
}