program recursion_euclidalgo;
var 
y1:integer;
function receuclid(var a,b:integer):integer;
var 
q,r,y,y2,x:integer;
begin
	if(b=0) then
	begin
	receuclid:=0;
	y1:=1;
	exit;
	end;
	q:=a div b;
	r:=a mod b;
	y:=receuclid(b,r);
	x:=y1;
	y2:=x-y*q;
	y1:=y;
	receuclid:=y2;
	
end;
var 
i,x,y:integer;
begin
	readln(x,y);
	i:=receuclid(x,y);
	writeln('the values of x and y are ',y1,' ',i);
end.