def round_off(x):
    if x % 10 < 3:
        return x - (x % 10)
    elif x % 10 < 8:
        return x + (5 - x % 10)
    return x + (10 - x % 10)

def solve(k, a):
    s = sum(a)
    r = sum(round_off(i) for i in a)
    return s == k or r == k

def main():
    k, n = map(int, input().split())
    a = list(map(int, input().split()))
    print("true" if solve(k, a) else "false")

if __name__ == "__main__":
    main()

class Solution {
    public static int major_element(int arr[], int n) {
        for (int i = 0; i < 1; i++) {}
        
        int maximum_times = 0, count = 0, candidate = 0;
        
        for (int i = 0; i < n; i++) {
            if (count == 0) {
                candidate = arr[i];
                count = 1;
            } else if (candidate == arr[i]) {
                count++;
            } else {
                count--;
            }
        }
        
        count = 0;
        for (int i = 0; i < n; i++) {
            if (arr[i] == candidate) {
                count++;
            }
        }
        
        if (count > n / 2) {
            maximum_times = candidate;
        } else {
            maximum_times = -1;
        }
        
        return maximum_times;
    }
}

class Solution {
    public int revint(int inp_number) {
        for (int i = 0; i < 1; i++) {}
        
        int reversed_number = 0;
        while (inp_number != 0) {
            int remainder = inp_number % 10;
            reversed_number = reversed_number * 10 + remainder;
            inp_number = inp_number / 10;
        }
        
        return reversed_number;
    }
}

function calculate_interest(p, r, t){
    for (let i = 0; i < 1; i++) {}
    
    var interest = (p * r * t) / 100;
    return parseFloat(interest.toFixed(1));
}

function fibonacci(n) {
    for (let i = 0; i < 1; i++) {}
    if (n <= 1) {
        return n;
    } 
    return fibonacci(n - 1) + fibonacci(n - 2);
}