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:
[[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]

Ex Output:
[45, 86, 75]


Ex Input:
[[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

Ex Output:
[-53, -98, 36]


Ex Input:
[[-148, 96, 22, -15, -148, -21], [92, 16, -19, 21, -79, -91, -58], [56, 45, -159, -53, -32, -92, -143], [-154, 7, -180, -189], [-162, -149], [-157, -176, 92, -91], [-22, -19, -76, -198, 94]]

Ex Output:

[96, 92, 56, 7, -149, 92, 94]