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.
[[-46, -79, -80, 91, -47, -52, -72], [-41, -142, 57, -145, -128], [-9, -71, -112, -30, -130], [-167, -185, -24, 33], [35, -168, -114, -52, -39, -31, 21], [-107, -71, -155, -105, -62, -165], [12, -43, -26, -98, -138], [37, -188]]