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:
[[-99, -133, 80, -160], [-10, -33, -172, 1, -182, -142, -140], [-105, -117, 58, 35, 83]]

Ex Output:
[80, 1, 83]


Ex Input:
[[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]

Ex Output:
[42, -49, 94, 89, -73, 5, -41, 89]


Ex Input:
[[27, -1, -138], [-36, -195], [-182, -64], [68, -125, -30, -121], [-163, -75], [-174, -22, -109, -42, -113, 28], [-15, -147, 86, 78]]

Ex Output:

[27, -36, -64, 68, -75, 28, 86]