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.
[[76, 98, 50, 49], [-34, -5, -128, -57], [99, -144, -68, 68, -7, -14, 14], [-15, -186, -5, -129, -37, 6], [-157, 32, -72, 8, -176, -109], [41, 11], [65, -146, -116, -192, -110, -141], [-142, -164, 33]]