Problem:
Score : 100 points

Problem Statement

Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.

To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.

Constraints

1≦A,B,C≦10

Input

The input is given from Standard Input in the following format:

A B C

Output

If it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.

Sample Input 1

5 5 7

Sample Output 1

YES

Using three phrases of length 5, 5 and 7, it is possible to construct a Haiku.

Sample Input 2

7 7 5

Sample Output 2

NO

Solution in Go (1.6) (judge verdict: Runtime Error)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	var n int
	var k int
	fmt.Scan(&n, &k)
	sc.Split(bufio.ScanWords)

	hates := getHates(k)

	var count int

	for i := n; i <= 9999; i++ {
		if count != len(hates) {
			count = 0
			for j := 0; j < len(hates); j++ {
				str := strconv.Itoa(i)
				if !strings.Contains(str, hates[j]) {
					count++
				}
			}
		} else {
			fmt.Println(i - 1)
			return
		}
	}
}

func getHates(k int) []string {
	var hates = make([]int, k, k)

	for i := 0; i < k; i++ {
		hates[i] = nextInt()
	}

	var strHates = make([]string, len(hates), len(hates))

	for i, hate := range hates {
		strHates[i] = strconv.Itoa(hate)
	}

	return strHates
}

func contains(s []int, e int) bool {
	for _, v := range s {
		if e == v {
			return true
		}
	}
	return false
}

func nextInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}