A good solution to get there in 2 minutes might look like this on paper:
M = xyz
M = y(10z + y)
y is prime
(10z + y) is prime
Note - the units digit of 10z + y is y.
From y being a prime digit, we know it must be in {2, 3, 5, 7}
For a multi-digit number to be prime, it's units digit must be in {1, 3, 7, 9}.
So given 10z + y is prime, whose units digit is y, we know that y must be in that set.
The intersection of these two constraints means that y must be in {3, 7}. Two cases to test, but how many permutations of z will we have to test? Hopefully not many.
Ah, another thing: the units digit of a product of two numbers is the product of their units digits. i.e. the units digit of ab * cd == units digit of b*d.
So given that M = y(10z+y), the units digits of M is the units digit of y*y.
Putting this together into a table of possibilities:
Great, only one option for z.
Testing these possibilities we find:
M = 3 * (10 * 9 + 3) = 279 // Doesn't fit, the y digit comes out as 7 instead of 3.
M = 7 * (10 * 9 + 7) = 679 // This works!