In the bustling city of Chorizolandia, Sergeant Camelas, a sharp and experienced traffic officer, has just pulled over a driver for a violation. The sergeant is well aware that in this city, some drivers attempt to "negotiate" their fines through subtle, often indirect means. To effectively identify these illicit attempts, the sergeant has meticulously memorized five secret keywords. He understands that if these five words are spoken consecutively by a driver, forming any one of their 5 possible ordered arrangements, it constitutes a clear signal of attempted bribery, leading to a significantly escalated fine.

The driver, desperate to avoid the standard traffic fine and completely unaware of the sergeant's unique detection method, decides to launch into a long, rambling statement. Their hope is to "smooth over" the situation by trying out various combinations of words, including, unknowingly, permutations of the sergeant's secret keywords.

Your task is to analyze the driver's complete sentence. Specifically, you must determine if any of the 5! permutations of the five secret keywords appears as a contiguous substring within the phrase the driver says to the sergeant. If such a specific keyword sequence is detected, indicating a negotiation attempt, the fine will be increased. Otherwise, the original fine remains in effect.