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:
[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
answer:
[47, 58, 99, -57, 92, -77, 30, 0, -38]


question:
[[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]
answer:
[77, 20, 78, 69, 77, 24, -5, 45]


question:
[[10, -96, -152, 4, 36], [-7, -82, 20, -194, -159, -181, -188], [-172, -14, 2, -38, -189], [-126, 31, -160, -187, 99, 25], [-138, -198, -76, 63, -139, -129], [-167, -100, -180, 85], [-30, -80, 17, -33, -119]]
answer:

[36, 20, 2, 99, 63, 85, 17]