#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint998244353;
vector<int> ans;
void solve(int a, int b){
    if(b==0) return;
    ans.push_back(a/b);
    solve(b, a%b);
}
int main()
{
    int a, b;cin>>a>>b;
    solve(a, b);
    for(int i=0; i<ans.size(); i++){
        cout<<ans[i];
        if(i+1<ans.size()) cout<<" ";
        else cout<<endl;
    }
    return 0;
}