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: [[-18, -120, -153, -70, 77, -106, -3], [-196, -40, -105, 2, -151, -114, 4]]

A: [77, 4]
****
Q: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

A: [18, 79, 47, 72]
****
Q: [[68, 54, -143, -64], [-110, -125, -46, -63, 65, -136, 67], [-119, -162], [-28, -159], [-160, 49, -180, 85, -199, -162], [27, -116, -82, -161, 92], [36, -66], [-80, -142, -109, -9, -158]]

A:
[68, 67, -119, -28, 85, 92, 36, -9]
****