You are given a list of strings where each string should represent one product record in the format "product,price,attention". Parse the valid records and return only the product names sorted with the following priority: price ascending, attention descending, and product name lexicographically ascending to break remaining ties. Price and attention are integers. Ignore malformed entries, including entries that do not have exactly three comma-separated fields or entries whose price or attention cannot be parsed as an integer. Whitespace around fields should be ignored. Approach: scan the input once, parse valid records into tuples, then sort using a tuple key of (price, -attention, product_name).