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:
[[-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:
[[-151, -194], [-174, 80, 60], [-84, 65, -199]]

Ex Output:
[-151, 80, 65]


Ex Input:
[[18, -27, -103, 58], [-134, -197, -67, -36], [-186, -11, -111, -4, -101, -61, 49], [71, -32], [-86, -57, -116, 68], [-191, 54, -93], [38, 80, -126, -27, -115, -21], [-152, -29, -60, -95, -76, -48]]

Ex Output:

[58, -36, 49, 71, 68, 54, 80, -29]