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]

[[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
[90, 65, 16, 93, 30]

[[-123, -82, -82], [-18, -60, 58], [86, -177, 43, -62, -200, -133, -108], [-33, -158, -114, -6, 11, -87, 40], [-27, 8], [41, 26, -170, -94, -50, -88], [0, -125, -144, -125], [-8, -76, -143, -46, 64, 23, -124], [-124, -103, 11, 25, 43, 29, 63]]

[-82, 58, 86, 40, 8, 41, 0, 64, 63]