// PR Bab 15, tantangan -- pembahasan.

#include <iostream>
using namespace std;

long long fpb_luas(long long a, long long b, long long &x, long long &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    long long x1, y1;
    long long g = fpb_luas(b, a % b, x1, y1);
    x = y1;
    y = x1 - (a / b) * y1;
    return g;
}

int main() {
    long long a, m, x, y;
    cin >> a >> m;

    long long g = fpb_luas(a, m, x, y);

    if (g != 1) {
        cout << "TIDAK ADA\n";
        return 0;
    }

    long long inv = ((x % m) + m) % m;      // x bisa negatif
    cout << inv << "\n";
    cout << a % m * inv % m << "\n";
    return 0;
}