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 <bits/stdc++.h>

using namespace std;

int main()
{
  int N, M, A[1000];


  while(cin >> N >> M, N) {
    for(int i = 0; i < N; i++) cin >> A[i];

    int ret = -1;
    for(int i = 0; i < N; i++) {
      for(int j = 0; j < i; j++) {
        if(A[i] + A[j] <= M) ret = max(ret, A[i] + A[j]);
      }
    }
    if(ret == -1) cout << "NONE" << endl;
    else cout << ret << endl;
  }
}

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

int a[1005],m,n,temp;
int main()
{
	while(scanf("%d %d",&n,&m))
	{
		temp=-1;
		if(n==0&&m==0) break;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		sort(a+1,a+1+n);
		for(int i=n;i>1;i--)
		{
			for(int j=n-1;j>1;j--) 
			if(a[i]+a[j]<=m&&temp<=a[i]+a[j])
			{
				temp=a[i]+a[j];
			}
		}
		if(temp==-1) printf("NONE\n");
		else printf("%d\n",temp);
		//for(int i=1;i<=n;i++)	cout<<a[i]<<' ';	
	}
	return 0;
}

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

int main() {
  int n, m;
  while (true) {
    cin >> n >> m;
    if (n==0 && m==0) {
      break;
    }
    int a[n];
    for (int i=0; i<n; i++) {
      cin >> a[i];
    }
    int ans = -INT_MAX;
    for (int i=0; i<n; i++) {
      for (int j=0; j<n; j++) {
	if (i!=j && a[i]+a[j]<=m) {
	  ans = max(ans,a[i]+a[j]);
	}
      }
    }
    if (ans<0) {
      cout << "NONE" << endl;
    } else {
      cout << ans << endl;
    }
  }
  return 0;
}

C++: #include<iostream>
#include<stdlib.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;

while(n!=0 && m!=0){
int a[n];
for(int i=0;i<n;i++){
    cin>>a[i];
}
long max=0; //最大値
long bg[2]={0,0}; //結果格納配列
for(int i=0;i<n-1;i++){
    for(int j=i+1;j<n;j++){
        long sum=a[i]+a[j];
        if(sum>max && sum<=m){
            max=sum;
            bg[0]=a[i];
            bg[1]=a[j];
        }
    }
}
if(bg[0]==0 && bg[1]==0){
    cout<<"NONE"<<endl;
}
else{
    cout<<bg[0]+bg[1]<<endl;
}
cin>>n>>m;

}

return 0;
}

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

int main(){
    int n, m;
    while(cin >> n >> m, n+m){
        vector<int> a(n);
        for(int i = 0; i < n; i++)  cin >> a[i];
        sort(a.begin(), a.end());
        if(a[0]+a[1] > m){
            cout << "NONE" << endl;
            continue;
        }
        int ans = 0;
        for(int i = 0; i < n; i++){
            if(a[i] >= m)    break;
            int j = lower_bound(a.begin(), a.end(), m-a[i])-a.begin();
            if(j >= n || a[j]+a[i] > m)   j--;
            if(j >= 0 && i != j)  ans = max(ans, a[i]+a[j]);
        }
        cout << ans << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
using namespace std;
typedef long long int ll;
typedef pair <int, int> P;

const ll MOD=1000000007;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    for(;;){
        int n,m;
        cin>>n>>m;
        if(!n) return 0;
        vector<int> a(n);
        rep(i,0,n) cin>>a[i];
        int res=-1;
        rep(i,0,n){
            rep(j,i+1,n){
                if(a[i]+a[j]<=m) res=max(res, a[i]+a[j]);
            }
        }
        if(res==-1) cout <<"NONE"<<"\n";
        else cout <<res<<"\n";
    }
}