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.

[[-64, -3, -2, -22, -84, -12], [-36, -191, -120, 10, -78, -105], [39, -185, -109, -111, -136], [-67, -119, 16, 0, -160], [-156, 38, -124, -189], [-42, -151, -157, 72, 11, -39], [3, -199], [-94, -71, 61, -21, -47, 14, 90], [-167, 20]]
Output:
[-2, 10, 39, 16, 38, 72, 3, 90, 20]