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.
[[-40, -188, -186], [-45, -169, -8], [-93, -149, -170, 60], [-40, -80, -137, -105, 65, -30, -197], [-83, -38, -148, -54, -96], [12, -43], [7, -156, -103], [19, -141, -189, 84, -26]]