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.

Ex Input:
[[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]]

Ex Output:
[52, 39, 95, 2, -17, 57, 73, 70, 44]


Ex Input:
[[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]

Ex Output:
[65, 45, 9]


Ex Input:
[[-128, -143, -34, -23, -163, 15, -138], [-176, -27, 86, -94, -55], [-128, -95], [22, -100, -58, 99, -72, -158], [-112, -49, -40, -149, -123, -67, -160]]

Ex Output:

[15, 86, -95, 99, -40]