//15MS	228K
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#define M 10007
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
long long extended_euclidean(long long n, long long m, long long &x, long long &y)
{
    if (m == 0)
    {
        x = 1;
        y = 0;
        return n;
    }
    long long g = extended_euclidean(m, n % m, x, y);
    long long t = x - n / m * y;
    x = y;
    y = t;
    return g;
}
int main()
{
    ll a,b,x,y;
    while(scanf("%I64d%I64d",&a,&b)!=EOF)
    {
        ll d=extended_euclidean(a,b,x,y);
        if(1%d)printf("sorry\n");
        else
        {
            while(x<0){x+=b;y-=a;}
            printf("%I64d %I64d\n",x,y);
        }
    }
    return 0;
}