// Algoritmul lui Euclid extins
#include<bits/stdc++.h>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
int a,b,c,d,t,x,y;
void euclid(int a, int b, int &d, int &x, int &y)
{
    if (b == 0){
        d = a;
        x = 1;
        y = 0;
    }
    else
    {
        int x0, y0;
        euclid(b, a % b, d, x0, y0);
        x = y0;
        y = x0 - (a / b) * y0;
    }
}
int main()
{
    f>>a>>b;
    euclid(a,b,d,x,y);
    if(x<0)
        x=x+(x/b+1)*b;
    g<<x<<" "<<y;
    return 0;
}