instruction:
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.
question:
[[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]
answer:
[-68, 30, 99, 15]


question:
[[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]
answer:
[18, 79, 47, 72]


question:
[[-2, -3], [45, -89, 60, -52, 47, -129], [60, -128, -92], [-177, -55, 89, -56], [35, -184, -100, 63, -122, -64, -192], [89, -17, -67, 40, 44], [-192, 39, -101, -9], [-52, -69, 53]]
answer:

[-2, 60, 60, 89, 63, 89, 39, 53]