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.

[[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]
[95, 60, 31, -122, 66, 84, 17]

[[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]
[38, 98, 39, 24, -38, 1]

[[53, -146, -170, -51, 69, -119], [-113, -6, -186, -13, -77, -70, -39], [48, -147, 77, -83, -144, -19], [-68, -179, 67], [5, 86, -160, 22, -29]]

[69, -6, 77, 67, 86]