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.

Q: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]

A: [-26, 31, -27, 94, 69, 47, 55, -8]
****
Q: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

A: [-53, -98, 36]
****
Q: [[-2, -132], [-111, 10, -112, 1, 26], [89, -38, 45, -96, 31], [-131, -186, -165, 38], [47, 1, -198, 50], [13, -99]]

A:
[-2, 26, 89, 38, 50, 13]
****