#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define eb emplace_back
#define pb push_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline int rd() {
    int x = 0;
    bool f = false;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

int L, n;

void work() {
    L *= 10'000'000;
    vector<int> num;
    rep(i, 1, n) {int x; cin >> x; num.eb(x);}
    sort(all(num));
    int ptr = 0;
    per(i, n - 1, 1) {
        while (ptr < n && num[ptr] + num[i] < L) ++ptr;
        if (ptr >= i) break;
        if (num[ptr] + num[i] == L) {
            printf("yes %d %d\n", num[ptr], num[i]);
            return;
        }
    }
    puts("danger");
}

int main() {
    while (cin >> L >> n) work();
    return 0;
}