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:
[[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]
answer:
[73, 26, 81, 48, 31, 25, 44, 31]


question:
[[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
answer:
[86, 76, -100, 99, 27, -48]


question:
[[53, 77, 80, -105, 3], [99, -82, -171], [93, -26, -149], [-11, -194, -85, 53], [-50, 40, -163, -83, -76, -170, -146], [93, -60, 34, -166]]
answer:

[80, 99, 93, 53, 40, 93]