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:
[[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
answer:
[53, 34, 91, 40]


question:
[[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]
answer:
[-92, 90, 8, 74, -126, 6, 7, -86]


question:
[[-103, -73, 47, 78, 90], [-32, -98, -47], [-190, 48, -156, 75, 68], [13, -23], [-41, -90, -164, 50, -64, 23]]
answer:

[90, -32, 75, 13, 50]