import java.util.*;

public class Euler175 {
    static List<Long> expansion(long p, long q) {
        long g = gcd(p, q);
        p /= g;
        q /= g;
        List<Long> result = new ArrayList<>();
        while (q != 0) {
            if (p > q) {
                long nxt = (p - 1) % q + 1;
                result.add((p - nxt) / q);
                p = nxt;
            } else {
                long nxt = q % p;
                result.add((q - nxt) / p);
                q = nxt;
            }
        }
        Collections.reverse(result);
        return result;
    }

    static long gcd(long a, long b) {
        while (b != 0) {
            long t = b;
            b = a % b;
            a = t;
        }
        return a;
    }

    public static void main(String[] args) {
        List<Long> r = expansion(123456789L, 987654321L);
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < r.size(); i++) {
            if (i > 0)
                sb.append(',');
            sb.append(r.get(i));
        }
        System.out.println(sb);
    }
}