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:
[[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

Ex Output:
[82, -35, 37, 86, 1, 46, 99]


Ex Input:
[[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

Ex Output:
[90, -4, 18]


Ex Input:
[[-194, -35, 91, 43, 99, 99, -64], [-121, 57, -27, -138, -97], [-172, 10, -5, -130, 19, -186], [-88, -11, -93, 50, -46, -69, -165], [2, -90, -157, 59, -28, -190], [-121, 46, -164, -96, -42], [-22, -28, -142, -59, -37, -187], [-50, 100, -61, -25, -47, -196, -164], [45, -138]]

Ex Output:

[99, 57, 19, 50, 59, 46, -22, 100, 45]