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:
[[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
answer:
[66, 16, 16, 69, 12, 80]


question:
[[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]
answer:
[-20, 93, 17, 91, 69, 44, -21, 98, 25]


question:
[[-190, 86, 82, -184, -84], [27, 9, -134, -80, -183, -87], [71, -181, 100, -62, -147], [-125, -137, -66, 15, -29, -67], [29, 49, -66, 65, -88, -40, -159]]
answer:

[86, 27, 100, 15, 65]