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.
[[-98, -195, -36, 54, 34], [-54, -150], [-153, 61, -165, -90, 15, 4, 86], [27, -18, -16], [18, 75], [91, -36], [-74, 53, 23, -155, -77, -160], [-106, 81, -123]]