Go: package main

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

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		n, m := io.NextInt(), io.NextInt()
		if n == 0 {
			break
		}
		a := make([]int, n)
		for i := 0; i < n; i++ {
			a[i] = io.NextInt()
		}
		ans := 0
		for i := 0; i < n; i++ {
			for j := i + 1; j < n; j++ {
				if a[i]+a[j] <= m {
					ans = intMax(a[i]+a[j], ans)
				}
			}
		}
		if ans == 0 {
			io.Println("NONE")
		} else {
			io.Println(ans)
		}
	}
}

func intMax(a, b int) int {
	if a < b {
		return b
	}
	return a
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: /*#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<map>
#include<cstdio>
#include<stack>
#include<queue>
#include<fstream>
#include<cstdio>
#include<deque>
#include<iomanip>
#include <random>

using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);(i)--)
#define all(a) (a).begin(),(a).end()
#define reall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define pf push_front
#define MIN(a,b) a=min((a),(b))
#define MAX(a,b) a=max((a),(b))
#define SIZE(v) (int)v.size()
const double pi = acos(-1.0);

typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef deque<ll> dll;
#define mod 1e9 + 7;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cout.setf(ios::fixed);
	cout.precision(20);

	vs v;
	string s1, s2;
	vs cs1, cs2;
	while (true) {
		cin >> s1;
		if (s1 == ".") break;
		cin >> s2;
		ll sum = 0;
		if (s1 == s2) v.pb("IDENTICAL");
		else {
			rep(i, s1.size()) {
				rep(j, s1.size()) {
					if (i != j && s1[i] == '"' && s1[j] == '"') {
						cs1.pb(s1.substr(i + 1, j - 1));
						s1[i] = '0'; s1[j] = '0';
					}

				}
			}
			rep(i, s2.size()) {
				rep(j, s2.size()) {
					if (i != j && s2[i] == '"' && s2[j] == '"') {
						cs2.pb(s2.substr(i + 1, j - 1));
						s2[i] = '0'; s2[j] = '0';
					}

				}
			}
			rep(i, cs1.size()) {
				cout << cs1[i] << " " << cs2[i] << endl;
				if (cs1[i] != cs2[i]) sum++;
				if (sum == 2) break;
			}
			if (sum == 1) v.pb("CLOSE");
			else v.pb("DIFFERENT");
		}
	}
	rep(i, v.size()) cout << v[i] << endl;
	return 0;
}*/
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<map>
#include<cstdio>
#include<stack>
#include<queue>
#include<fstream>
#include<cstdio>
#include<deque>
#include<iomanip>

using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);(i)--)
#define all(a) (a).begin(),(a).end()
#define reall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define pf push_front
#define MIN(a,b) a=min((a),(b))
#define MAX(a,b) a=max((a),(b))
#define SIZE(v) (int)v.size()
const double pi = acos(-1.0);

typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef deque<ll> dll;
#define mod 1e9 + 7;

int main()
{
	ios_base::sync_with_stdio(false);

	ll n, m;
	vi w;
	while (true) {
		cin >> n >> m;
		if (n == 0 && m == 0) break;
		vi v(n);
		ll ans = 0;
		rep(i, n) cin >> v[i];
		rep(i, n) {
			rep(j, n) {
				if (i == j) break;
				if (v[i] + v[j] == m) {
					ans = m;
				}
				else {
					if (ans < v[i] + v[j] && v[i] + v[j] < m)
						ans = v[i] + v[j];
				}
			}
		}
		w.pb(ans);
		
	}
	rep(i, w.size()) {
		if (w[i] == 0) puts("NONE");
		else cout << w[i] << endl;
	}
	return 0;
}

C++: #include<stdio.h>

int main(void) 
{
  int n,m,a[1000];
  int i,j,sum,max;

	while(scanf("%d %d",&n,&m))
   {	
    if(n==0&&m==0)
	break;
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	max =0;
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			sum=a[i]+a[j];
			if(sum>max&&sum<=m)
			max = sum;
		}
	}
	if(max==0)
	printf("NONE\n");
	else
	printf("%d\n",max);
   }
	return 0;
}

C++: /*  -*- coding: utf-8 -*-
 *
 * 1616.cc: Taro's Shopping
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000;

/* typedef */

/* global variables */

int as[MAX_N];

/* subroutines */

/* main */

int main() {
  for (int n, m; scanf("%d%d", &n, &m) == 2 && n > 0;) {
    for (int i = 0; i < n; i++) scanf("%d", as + i);

    int maxsum = -1;
    for (int i = 0; i < n; i++)
      for (int j = i + 1; j < n; j++) {
	int sum = as[i] + as[j];
	if (sum <= m && maxsum < sum) maxsum = sum;
      }

    if (maxsum < 0) puts("NONE");
    else printf("%d\n", maxsum);
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, m;
    while (cin >> n >> m, n) {
        vector<int> a(n);
        for (int i = 0; i < n; ++i) cin >> a[i];

        int res = 1<<29;
        for (int i = 0; i < n; ++i) {
            for (int j = i+1; j < n; ++j) {
                if (a[i] + a[j] > m) continue;
                res = min(res, m - a[i] - a[j]);
            }
        }
        if (res < 1<<29) cout << m - res << endl;
        else cout << "NONE" << endl;
    }
}

C++: #include<cstdio>

int main(){
  int n,m;
  int A[10000];
  int B[10000];
  int max;
  
  while(1){
    std::scanf("%d %d",&n,&m);
    if(n == 0 && m == 0) break;
    bool flag = 1;
    for(int i = 0;i < n;i++){
      std::scanf("%d",&A[i]);
    }

    max = A[0] + A[1];
    
    if(max < m){
      flag = 0;
    }
  
    for(int i = 0;i < n;i++){
      for(int j = i + 1;j < n;j++){
	if(max < A[i] + A[j] && (A[i] + A[j]) <= m){
	  max = A[i] + A[j];
	  flag = 0;
	}
      }
    }

    if(!flag){
      std::printf("%d\n",max);
    }else{
      std::printf("NONE\n");
    }
  }
  
  return 0;
}