Top K Security Log Extractor

Problem

Given a list of log lines logs, an integer window_seconds, and an integer k, return the k most frequent suspicious IP addresses seen within any sliding time window of length window_seconds. Each valid log line has the format "<timestamp> <ip> <status>", where timestamp is an integer, ip is a string, and status is either "OK" or "FAIL". Only FAIL events count. Ignore malformed lines.

Constraints

• 1 <= len(logs) <= 10^5
• 1 <= window_seconds <= 10^9
• 1 <= k <= 10^4
• Timestamps are non-negative integers
• Log lines may be unsorted and may contain malformed entries