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.

[[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
[-33, 49, 37, -34, 92, 57, 19, 72, -92]

[[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[53, 41, 80, 98, 91, 62]

[[78, 3, -186, -60, -85, -7], [-3, -75, -30], [63, -19, -166], [-47, -88, 58], [-94, -36, -79], [-134, -2, 43, 87]]

[78, -3, 63, 58, -36, 87]