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.
[[-136, -16, -17, 0, 50, 81], [-21, -151, -5, 52, 35], [-185, 29, -180, 51, -126, -16], [51, -169, -87, -140, -186], [17, 46, 94, -76, -62, -131, -51], [-56, -13, -85, -71, 82]]