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;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;


int main() {
  while(true){
  int a,b,ans=-1;
  cin >> a >> b;
  if (a==0 && b==0) break;
  vector<int> d(a);
  rep(i,a) cin >> d[i];
  rep(i,a){
    rep(j,a){
      if (i==j) continue;
      if (d[i]+d[j]<=b) ans=max(ans,d[i]+d[j]); 
    }
  }
  if (ans==-1) cout << "NONE" << endl;
  else cout << ans << endl;
  }
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()

using namespace std;

int main() {
  int n,m;
  while( cin >> n >> m, n|m ) {
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    sort(ALL(a));
    int maxi = -1;
    rep(i,n) {
      int rem = m - a[i];
      int ptr = upper_bound(ALL(a),rem) - a.begin();
      --ptr;
      if( ptr == i ) --ptr;
      if( ( 0 <= ptr && ptr < n ) && a[i] + a[ptr] <= m ) maxi = max(maxi,a[i]+a[ptr]);
    }
    ( maxi == -1 ) ? puts("NONE") : printf("%d\n",maxi);
  }
  return 0;
}
/*

#include<iostream>
#include<vector>
#include<algorithm>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()

using namespace std;

int main() {
  int n,m;
  while( cin >> n >> m, n|m ) {
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    int maxi = -1;
    rep(i,n) rep(j,n) if( i != j &&  ) maxi = max(maxi,);
    if( maxi == -1 ) puts("NONE");
    else             cout << maxi << endl;
    //( maxi == -1 ) ? puts("NONE") : printf("%d\n",maxi);
  }
  return 0;
}
*/

C++: #include<iostream>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

int n,m,a[1000];

map<int,int> c;

int main() {
    while(true) {
        cin >> n >> m;
        if(n == 0)break;
        rep(i,n){
            cin >> a[i];
            c[a[i]] = 0;
        }
        rep(i,n) {
            c[a[i]]++;
        }
        sort(a,a+n);//aをソート

        int ans = -1;
        rep(i,n) {
            auto itr = upper_bound(a,a+n,m - a[i]);//m-a[i]<a[j] となる最小のjのa[j]へのポインタを取得
            if(itr - a == 0) {//m - a[i]>=a[j]を満たすjが存在しない時
                continue;
            }
            itr--;//ポインタを一つ減算してm-a[i]>=a[j]となる最大のjのa[j]へのポインタを取得
            if(*itr == a[i] && c[a[i]] < 2) {//境界のものがa[i]だった時
                if(itr - a == 0) {//a[i]未満のものがない時
                    continue;
                }
                itr--;//さらに一つ前に
            }
            ans = max(ans,*itr + a[i]);
        }
        if(ans == -1)cout << "NONE" << endl;
        else cout << ans << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
#define ll long long
#define INF 1000000000
using namespace std;
int main(){
    int N,M;
    while(1){
        cin >> N >> M;
        if(N+M==0) return 0;
        int A[N];
        for(int i=0;i<N;i++) cin >> A[i];

        int ans = 0, Max = 0;
        for(int i=0;i<N;i++){
            for(int j=0;j<N;j++){
                if(i!=j){
                    int now = A[i]+A[j];
                    if(now<=M){
                        ans = max(ans,now);
                    }   
                }
            }
        }
        if(ans!=0) cout << ans << endl;
        else cout << "NONE" << endl;
    }
}

C++: #include <iostream>

using namespace std;

int main() {
    int a[1001];
    int n, m;
    while (cin >> n >> m) {
        if (n == 0 && m == 0) { break; }
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        int ans = -1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (a[i] + a[j] <= M && a[i] + a[j] > ans) {
                    ans = a[i] + a[j]
                }
            }
        }
        cout << (ans == -1 ? "NONE" : string(ans)) << endl;
    }
    return 0;
}

C++: #include<stdio.h>

#define MAX 2000000

int select(int S[],int n,int max){
  int ans=0;
  int temp;
  for(int i = 0;i<n;i++){
    for(int j = i+1;j<n;j++){
      temp = S[i]+S[j];
      if(temp <= max && ans <= temp){
	ans = temp;
      }
    }
  }

  return ans;
}

int main(){

  int n;
  int a;
  int m;
  int k =0;
  int ans[10];
  int S[MAX];

  while(1){
    scanf("%d",&n);
    scanf("%d",&m);
    if(n==0 && m == 0){
      break;
    }
    for(int i = 0;i<n;i++){
      scanf("%d",&a);
      S[i] = a;
    }

    ans[k] = select(S,n,m);
    k++;
  }


  for(int i = 0;i<k;i++){
    if(ans[i]==0){
      printf("NONE\n");
    }else{
      printf("%d\n",ans[i]);
    }
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
  int n, m;

  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> m;

  int a[n];
  for(int i = 0; i < n; i++) cin >> a[i];

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

  if(max != 0)
    cout << max << endl;
  else
    cout << "NONE" << endl;
  return 0;
}