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.

[[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[52, 39, 95, 2, -17, 57, 73, 70, 44]

[[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]
[-42, 30, 87, 34]

[[-33, 59], [33, 54, -145, -67, -115], [-36, -19, 64, 51, -40], [-19, -23, -38, 85, -9, -82], [11, -21, -179, 28, -116, -121, -64], [39, 7, -171, -87, -130, -66], [28, -20, -184, -181]]

[59, 54, 64, 85, 28, 39, 28]