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.
[[41, -191, 34, -12, -181, -93], [40, -103, -116, -167, 20, -56], [-157, 20, -123, -171, 93, 1, -60], [-138, -73, -61, 8, -116, -43, -19], [-156, -136, -1, -50, 77, -92, -107], [31, 36, -138, -96, -11], [-34, 46, 93], [53, -19, -159, -146, 18]]