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.
[[-147, 32, -195, -137, -75, -67, -47], [-98, -16], [-60, -13, 51], [45, -134, -36, -44], [3, 18, -118, -148], [89, -152, 49, -164], [97, 68, 61], [-64, -179, -124, -55, -64], [13, -137, 96, -173, 10]]