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.
[[34, 1, -33], [53, -160, -60], [30, -52], [1, 84, -90, -29, -196], [-28, -44, -4, -39], [-44, -165, -190, -114, 86, -6, 77], [-176, 47, 53, 87], [-197, -148], [-127, -120, -66, -192, 12, -32]]