#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const double PI = acos(-1.0);

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;

vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

template <typename T>
class Matrix
{
public:
  //static const int MAX_N = 210, MAX_M = 210;
  size_t N, M; //N*M行列
  vector<vector<T>> data;

  Matrix(size_t init_N, size_t init_M) : N(init_N), M(init_M)
  {
    data.resize(N, vector<T>(M));
  }

  Matrix operator+(const Matrix &A)
  {
    assert(A.N == N && A.M == M);
    Matrix res(N, M);
    rep(i, N) rep(j, M) res[i][j] = data[i][j] + A[i][j];
    return res;
  }

  Matrix &operator+=(const Matrix &A)
  {
    assert(A.N == N && A.M == M);
    rep(i, N) rep(j, M) data[i][j] += A[i][j];
    return *this;
  }

  Matrix operator-(const Matrix &A)
  {
    assert(A.N == N && A.M == M);
    Matrix<T> res(N, M);
    rep(i, N) rep(j, M) res.data[i][j] = data[i][j] - A[i][j];
    return res;
  }

  Matrix &operator-=(const Matrix &A)
  {
    assert(A.N == N && A.M == M);
    rep(i, N) rep(j, M) data[i][j] -= A[i][j];
    return *this;
  }

  Matrix operator*(const Matrix &A)
  {
    assert(M == A.N);
    Matrix res(N, A.M);

    rep(i, N) rep(j, A.M)
    {
      rep(k, M) res[i][j] += data[i][k] * A[k][j];
    }
    return res;
  }

  Matrix &operator*=(const Matrix<T> &A)
  {
    return *this = *this * A;
  }

  Matrix operator*(T a)
  {
    Matrix res(N, M);
    rep(i, N) rep(j, M) res[i][j] = data[i][j] * a;
    return res;
  }

  Matrix &operator*=(ll a)
  {
    rep(i, N) rep(j, M) data[i][j] *= a;
    return *this;
  }

  inline const vector<T> &operator[](int index) const
  {
    return (data.at(index));
  }

  inline vector<T> &operator[](int index)
  {
    return (data.at(index));
  }

  bool operator==(Matrix &A)
  {
    if (N != A.N || M != A.M)
      return false;

    rep(i, N) rep(j, M)
    {
      if (data[i][j] != A[i][j])
        return false;
    }
    return true;
  }

  bool operator!=(Matrix &A)
  {
    return !(*this == A);
  }

  Matrix transpose()
  {
    Matrix res(M, N);
    rep(i, N) rep(j, M) res[j][i] = data[i][j];
    return res;
  }

  ll trace()
  {
    assert(N == M);
    ll res = 0;
    rep(i, N) res += data[i][i];
    return res;
  }

  void display()
  {
    rep(i, N)
    {
      rep(j, M) cerr << data[i][j] << " ";
      cerr << endl;
    }
  }

  Matrix E(const ll n)
  {
    Matrix res(n, n);
    rep(i, n) rep(j, n) res[i][j] = (i == j);
    return res;
  }

  Matrix pow(const ll n)
  {
    assert(N == M);
    bitset<60> bs(n);
    int pow_cnt = 0;
    rep(i, 60) if (bs[i]) pow_cnt = i + 1;
    Matrix P = *this;
    Matrix res = E(N);

    rep(i, pow_cnt)
    {
      if (bs[i])
        res *= P;
      P *= P;
    }
    return res;
  }
};

template <typename T>
Matrix<T> operator*(ll a, Matrix<T> &A)
{
  Matrix<T> res(A.N, A.M);
  rep(i, A.N) rep(j, A.M) res[i][j] = A[i][j] * a;
  return res;
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(50) << setiosflags(ios::fixed);

  ll A, B;
  cin >> A >> B;
  ll a = A, b = B;
  if (a < b)
    swap(a, b);
  Matrix<ll> Q(2, 2);
  Q = Q.E(2);

  while (b != 0)
  {
    Matrix<ll> m(2, 2);
    m[0][0] = 0;
    m[0][1] = 1;
    m[1][0] = 1;
    m[1][1] = -(a / b);
    Q = m * Q;
    ll temp = b;
    b = a % b;
    a = temp;
  }
  ll s = Q[0][0], t = Q[0][1];
  if (A < B)
    swap(s, t);
  ll before = abs(s) + abs(t);
  ll ans1 = s, ans2 = t;
  ll g = __gcd(A, B);
  for (ll i = 1;; i++)
  {
    ll x = (B / g) * i + s;
    ll y = -(A / g) * i + t;
    assert(A * x + B * y == g);
    if (before > abs(x) + abs(y))
    {
      ans1 = x, ans2 = y;
      before = abs(x) + abs(y);
    }
    else if (before == abs(x) + abs(y) && x <= y)
    {
      ans1 = x, ans2 = y;
      break;
    }
    else
    {
      break;
    }
  }

  for (ll i = -1;; i--)
  {
    ll x = (B / g) * i + s;
    ll y = -(A / g) * i + t;
    assert(A * x + B * y == g);
    if (before > abs(x) + abs(y))
    {
      ans1 = x, ans2 = y;
    }
    else if (before == abs(x) + abs(y))
    {
      ans1 = x, ans2 = y;
      break;
    }
    else
    {
      break;
    }
  }

  cout << ans1 << " " << ans2 << endl;
  return 0;
}



Measured memory_bytes: 3216