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.
[[95, -101, -188, -81, -50, 23, 72], [-118, 97, -135, -108, 41, -51], [91, -3, 75, -96], [-90, -102, -108, 24, -51], [66, -93], [33, -115, -40, 7, -162, 11], [-36, 29, 30, -53, 68, 33, -1], [-26, -92, 92, -59], [-108, 81, -98, 56, -36]]