In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-88, -166, -101, -103, 12, -33], [66, 39, -15, -27, -159, 46], [15, -46, 94, -28, -25, -98], [-80, -160, -50, -120], [-146, 1, 51, 37, -88, -38], [-36, 82, -66, 73, -144, -41], [47, 1, 71, -125, -90]]