Problem:
Score : 200 points

Problem Statement

A string is called a KEYENCE string when it can be changed to keyence by removing its contiguous substring (possibly empty) only once.

Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.

Constraints

The length of S is between 7 and 100 (inclusive).

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S is a KEYENCE string, print YES; otherwise, print NO.

Sample Input 1

keyofscience

Sample Output 1

YES

keyence is an abbreviation of key of science.

Sample Input 2

mpyszsbznf

Sample Output 2

NO

Sample Input 3

ashlfyha

Sample Output 3

NO

Sample Input 4

keyence

Sample Output 4

YES

Solution in Kotlin (1.0.0) (judge verdict: Accepted)

private val scanner = java.util.Scanner(System.`in`)

private fun readInts(n: Int) = Array(n) { scanner.nextInt() }
private fun readLongs(n: Int) = Array(n) { scanner.nextLong() }
private fun readLineInts() = readLine()!!.split(" ").map { it.toInt() }.toTypedArray()
private fun readLineLongs() = readLine()!!.split(" ").map { it.toLong() }.toTypedArray()

private val KEYENCE = "keyence"

fun main(args: Array<String>) {
    val S = readLine()!!

    for (i in 0 until KEYENCE.length) {
        val raw = "${KEYENCE.dropLast(i + 1)}.*${KEYENCE.drop(KEYENCE.length - i - 1)}"

        if (Regex(raw).matches(S)) {
            println("YES")
            return
        }
    }

    if (Regex("${KEYENCE}.*").matches(S)) {
        println("YES")
        return
    }

    println("NO")
}