#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

int main() {
	int p, q;
	while(cin >> p >> q) {
		vi ans(80), res(80);
		int step = 0, s = -1;
		p *= 10;
		while(true) {
			ans[step] = p/q;
			res[step] = p%q;
			p %= q;
			step++;		
			if(p == 0) {
				goto show;
			} else {
				REP(i, step-1) {
					if(res[i] == p) {
						s = i;
						goto show;
					}
				}
				p *= 10;
			}
		}

show:
		REP(i, step) {
			cout << ans[i];
		}
		cout << endl;
		if(s != -1) {
			REP(i, step) {
				if(s < i) {
					cout << '^';
				} else {
					cout << ' ';
				}
			}
			cout << endl;
		}
	}

	return 0;
}