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.
[[-175, 26, -61, 68, -24, -154, -196], [-82, -48], [-13, -24, -70, -134, 79, -40, -62], [89, 99, -122, 8, -87], [68, -35, -175, 29, 69, 79], [52, -19, -58, 19, 43, 4], [21, -74, -98, -79, -79, -77, -172], [-168, -175, -127, -71, -129, 95]]