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:
[[-132, 87, 9, -146, -184], [97, -169, -21, 52, 16, -182, -6], [-60, -2, -147, 55], [-111, -154, -41, 37, -97, -139, -111], [33, -113, -106, -92], [-13, 49, 66, -121, 61, -129, -124], [72, -107, -192, 86]]

Ex Output:
[87, 97, 55, 37, 33, 66, 86]


Ex Input:
[[-159, -198, 94, -173], [-44, -131, -174, 59, -34, -14, -164], [89, -171, 50, 12], [82, -28, -74, 48], [-178, -28], [-39, -128, -78, -91, -35, -21], [4, 6, 69, 49, -116, 49, -51], [-115, -4, -121, 93, -50, -185, 13], [-146, -198]]

Ex Output:

[94, 59, 89, 82, -28, -21, 69, 93, -146]