#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

//#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

#define MAX 1000
signed main() {
	pii a[MAX] = {};
	for (int p, q; cin >> p >> q;) {
		memset(a, 0, sizeof(a));
		string ans = "";
		int l, r;
		rep(i, 0, MAX) {
			p *= 10;
			bool flag = false;
			rep(j, 0, i) { if (a[j] == pii(p / q, p%q)) { l = j; r = i; flag = true; break; } }
			if (flag)break;
			a[i] = pii(p / q, p%q);
			ans += to_string(p / q);
			p %= q;
			if (p == 0)break;
		}
		cout << ans << endl;
		if (p != 0) {
			rep(i, 0, l)cout << " ";
			rep(i, l, r)cout << "^";
			cout << endl;
		}
	}
	return 0;
}