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.

Input: Consider Input: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]

Output: [85, -8, 67, 45, 71, 91]


Input: Consider Input: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]

Output: [64, 55, 92, 95, 72, -29, 63]


Input: Consider Input: [[3, -16, 14, 14], [44, -30, -168], [-151, -77], [35, 83, -53, 38, -163], [3, -92, -15, -10, 47, -4, -25]]


Output: [14, 44, -77, 83, 47]