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:
[[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]

Ex Output:
[43, 72, 10, 92, 85, -104, 41, 19]


Ex Input:
[[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]

Ex Output:
[78, 86, -72, -153]


Ex Input:
[[72, 30, 92, -13, -121, -132], [-58, -179], [-95, -158, -163, -187], [-140, -90, 21]]

Ex Output:

[92, -58, -95, 21]