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.
[[12, 44, -168, -175, -130], [-175, 17, -17, -41], [-78, -192, 76, 35], [-43, -154, 66, -144, -107, -32, -187], [100, -114, -118, -143, -64, -170, -121], [37, -142, 25], [-135, -43, -189, -144, -41, -195, -22]]