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.
[[-103, 39, -4, -131, -179], [4, -70, -142, -41, -18, -37], [16, 32, -48], [40, -134], [-186, -147, -130, 77, -6], [-44, -123, 43, -31, -92, -86, 49], [-41, -109, -1, 42, 34], [-164, 16, 96, 94, -38, 84], [61, -190]]