### Solving two-variable equations mod p

I am able to, in wolfram alpha, plug in the equation

11=x*(y^119)^149mod151

and wolfram is able to give me a set of non-zero solutions (x,y) that I think satisfy (11*y^119, y)

I have tried using symbolic equations and the sage quickstart for number theory to replicate this functionality, but I am getting stuck on some integer conversion TypeErrors in sage.

I have tried to set it up like:

x,y = var('x,y');

qe=(mod(x*(y^119)^149,151)==mod(11,151))

Can someone help me set up this equation, and then solve for all possible non-zero solutions?

THanks!