#include <bits/stdc++.h>
using namespace std;

#pragma warning(disable : 4267) // "int n = (unsigned)size"

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-9;
const double INFD = numeric_limits<double>::infinity();
const double PI = 3.14159265358979323846;
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
bool nearlyeq(double x, double y) { return abs(x - y) < eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

/*******************************************************/

class Extended_Euclid {
private:
	ll ex_gcd(ll m, ll n, vll &q) {
		if (n == 0) return m;
		q.push_back(m / n);
		return ex_gcd(n, m % n, q);
	}
	vvll mul2(vvll A, vvll B) {
		vvll ret(2, vll(2));
		Loop(i, 2) {
			Loop(j, 2) {
				Loop(k, 2) {
					ret[i][j] += A[i][k] * B[k][j];
				}
			}
		}
		return ret;
	}
	bool inrange(ll x, ll y, Pll x_rng, Pll y_rng) {
		if (x_rng.fst <= x && x <= x_rng.snd && y_rng.fst <= y && y <= y_rng.snd) return true;
		else return false;
	}
	bool subst_d(ll &x, ll &y, ll d, Pll x_rng, Pll y_rng) {
		ll xc = x, yc = y;
		x = xc + n / g * d;
		y = yc - m / g * d;
		if (inrange(x, y, x_rng, y_rng)) return true;
		x = xc + n / g * (d - 1);
		y = yc - m / g * (d - 1);
		if (inrange(x, y, x_rng, y_rng)) return true;
		x = xc + n / g * (d + 1);
		y = yc - m / g * (d + 1);
		if (inrange(x, y, x_rng, y_rng)) return true;
		return false;
	}
	ll m, n, g, x, y;
public:
	// runtime error for (m, n) = (0, 0)
	Extended_Euclid(ll m, ll n) {
		this->m = m;
		this->n = n;
		vll q;
		g = ex_gcd(m, n, q);
		vvll A = { {1,0},{0,1} };
		Loop(i, q.size()) {
			A = mul2({ { 0,1 },{1,-q[i]} }, A);
		}
		x = A[0][0];
		y = A[0][1];
	}
	bool solve(ll &x, ll &y, ll z, Pll x_rng = { LLONG_MIN, LLONG_MAX }, Pll y_rng = { LLONG_MIN, LLONG_MAX }) {
		if (z % g != 0) return false;
		else {
			ll q = z / g;
			x = this->x * q;
			y = this->y * q;
			if (inrange(x, y, x_rng, y_rng)) return true;
			if (x_rng.fst != LLONG_MIN) {
				ll d = (x_rng.fst - x) / (n / g);
				if (subst_d(x, y, d, x_rng, y_rng)) return true;
			}
			if (x_rng.snd != LLONG_MAX) {
				ll d = (x_rng.snd - x) / (n / g);
				if (subst_d(x, y, d, x_rng, y_rng)) return true;
			}
			if (y_rng.fst != LLONG_MIN) {
				ll d = (y_rng.fst - y) / (m / g);
				if (subst_d(x, y, -d, x_rng, y_rng)) return true;
			}
			if (x_rng.snd != LLONG_MAX) {
				ll d = (y_rng.snd - y) / (m / g);
				if (subst_d(x, y, -d, x_rng, y_rng)) return true;
			}
			return false;
		}
	}
};

int main() {
	ll m, n; cin >> m >> n;
	Extended_Euclid ee(m, n);
	ll x, y;
	ee.solve(x, y, gcd(m, n));
	cout << x << " " << y << endl;
}


Measured memory_bytes: 3168