#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>
#include <complex>
#include <sstream>
#include <stack>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef complex<double> Point;

int main()
{
	int p, q;
	
	while(scanf("%d%d", &p, &q) != EOF){
		int minimum;
		int maximum;
		int loop = false;
		map<int, int> memo;
		for(maximum=0; p; ++maximum){
			p *= 10;
			if(memo.count(p)){
				loop = true;
				minimum = memo[p];
				break;
			}else{
				memo[p] = maximum;
				printf("%d", p/q);
				p %= q;
			}
		}
		putchar('\n');
		
		if(loop){
			rep(i, maximum)
				putchar(i<minimum ? ' ' : '^');
			putchar('\n');
		}
	}
}