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:
[[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]
answer:
[86, 46, -128, 81, 40, 67]


question:
[[-54, -80, 72, -155], [-182, 65]]
answer:
[72, 65]


question:
[[-73, -81, -49, -7], [-178, -1, -192, 29, 95, 56, -3], [-124, 92, -23, -140, -2], [-157, -51, -151, -53, 16, -112], [-129, 76, 45, -122, -181, -110], [-164, 61], [41, 36, -87], [-192, -1, -167], [17, 20, -130]]
answer:

[-7, 95, 92, 16, 76, 61, 41, -1, 20]