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:
[[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

Ex Output:
[37, 32, 34, -3, 97, 97, 68]


Ex Input:
[[-132, -126, -31, 49, -119, 18, 77], [-38, -44], [59, 67, -64, 70, -43, -48, -167], [-162, -70, -114, -27, 86, 26, -184], [72, -187, -194, -90], [44, 40, -189, -100], [-46, -196, 91, -145, 100, -13]]

Ex Output:

[77, -38, 70, 86, 72, 44, 100]