What is the time complexity of this recurrence relation?

T(n) = 12 T(n/(logn)^2) + nlogn

How to find the value of b using masters theorem. I think with the help of masters theorem we can’t solve this. Is there any other method ?