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.

[[-72, 58], [-110, -110, 92, -58, -181, -159, 35], [-12, 67, -22, -15, -8, -190], [-163, -166, -128, -150, 70, 54]]
[58, 92, 67, 70]

[[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[71, 71, -38, 60, 7, 97, 76]

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

[-135, 19, -152, -91, 22, -152]