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:
[[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]

Ex Output:
[72, 36, 32, 2, 44, 89]


Ex Input:
[[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

Ex Output:
[99, 54, 32]


Ex Input:
[[-181, -31, -104], [98, -87, -151, -109, 63, -3, -37], [66, 56, 67, -1], [-190, -145, -194, -170, -48, -132, -24], [59, -186, 12, -145, -105, -156], [-180, -77, -162, -143, -143, 70], [-69, -171, 38, 47, 6, -134], [-41, -73]]

Ex Output:

[-31, 98, 67, -24, 59, 70, 47, -41]