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.
[[60, -87, 4, -135, 29, -15], [-149, -171, 61, -45], [-134, 10, 52, -176, -100, -55], [1, 44], [-158, -25, 43], [-91, 89, -123], [-4, 24, -39, 48, -154, -46], [-53, -59, -170, 38, -71, -130, -173], [-197, -12, -10, -192, -36, 11]]