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.
[[-30, -193, 100, -172, 75, -122], [-101, -146], [59, -132], [64, 15, -29, -61, -141, -93, -43], [13, 80, -73], [-21, -191, -18, -75, 87, -29], [47, 82, -170]]