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.

[[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]
[64, 19, 84, 40, 78]

[[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]
[-135, 19, -152, -91, 22, -152]

[[-93, 56, -145, -106, -133, -20, 63], [95, -35, -150], [-71, -24, 37]]

[63, 95, 37]