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:
[[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]

Ex Output:
[-21, 86, 29, 100]


Ex Input:
[[-33, -121, 40, 53, -88, 21, 99], [-101, -71, -140, 25, 93, -35], [-194, -148, -165], [-52, -115, -28, -22, -178], [-55, -151, 79, -146, -88, -125], [-134, -126, 86, 54]]

Ex Output:

[99, 93, -148, -22, 79, 86]