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.

[[-151, -194], [-174, 80, 60], [-84, 65, -199]]
[-151, 80, 65]

[[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]
[32, 26, 72, 53, 75, 58, 92, 44]

[[-35, 9, -125, -186, 20, 86, -57], [-188, -37, 2, -74], [-144, 35, 54, 42, -152, -169], [-196, -7, 33, -44, -67]]

[86, 2, 54, 33]