You will be given a definition of a task first, then some input of the task.
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.

[[-120, -110, 31, 58, 59, 96, 8], [-164, 46, 46, -70, -142], [100, -161, -146], [93, -131, -90, -6], [-61, -49, -51, 47, -1, -152, 20], [-89, 54, -18, -35, 89], [-49, -65, -39, -138, 0], [-96, -60, 52], [-106, 77, 76, 67, -164, -157, -137]]
Output:
[96, 46, 100, 93, 47, 89, 0, 52, 77]