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:
[[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]

Ex Output:
[71, 70, 33]


Ex Input:
[[-45, 59, -70, -36, -135], [90, 34, 84], [-167, -66], [-132, 41], [-140, -200, -69, 66], [-35, -24, -164, -123, -45, -132, -39], [-175, -175]]

Ex Output:

[59, 90, -66, 41, 66, -24, -175]