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 FOR(i,a,b) for(int i = (a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9+100;
const ll MOD = 1e9+7;

int n, m;
int a[1000];

int main() {
	while (cin >> n >> m, n || m) {
		REP(i, n) scanf("%d", a + i);
		sort(a, a + n);
		int ans = -1;
		REP(i, n) {
			int sum = a[i] + *(upper_bound(a, a + n, m - a[i]) - 1);
			if (sum <= m) chmax(ans, sum);
		}
		if (ans == -1) puts("NONE");
		else printf("%d\n", ans);
	}
	
	return 0;
}

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

int main(){
  while(true){
    int n, m;
    cin >> n >> m;

    if(n==0 && m==0)
     break;

    int a[1000];
    for(int i=0; i<n; i++){
      cin >> a[i];
    }
    int sum = -1;
    for(int i=0; i<n-1; i++){
      for(int j=i+1; j<n; j++){
        int p = a[i]+a[j];
        if(p<=m && p>sum){
          sum = p;
        }
      }
    }
    if(sum!=-1){
      cout << sum << endl;
    }
    else{
      cout << "NONE" << endl;
    }
  }
  return 0;
}

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

using namespace std;

int main(){
	int n, m;
	while(cin >> n >> m, n || m){
		vector<int> data(n);
		for(int i = 0; i < n; i++){//input
			cin >> data[i];
		}

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

		if(max == 0){//output
			cout << "NONE" << endl;
		} else {
			cout << max << endl;
		}
	}

	return 0;
}

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

int main(){
    int n;
    long m;
    long a[1002];

    while(true){
        cin >> n >> m;
        if(n == 0 && m == 0) break;
        long ans = -1;

        for(int i=0;i<n;i++) cin >> a[i];
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(i != j){
                    if(a[i] + a[j] <= m){
                        ans = max(ans, a[i] + a[j]);
                    }
                }
            }
        }
        if(ans == -1){
            cout << "NONE" << "\n";
        }
        else{
            cout << ans << "\n";
        }

    }

    return 0;
}

C++: #include<bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n ; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x) // decltypeで型取得、引数があればva_argsのところに入れる
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 1e9;

int main(void){
   while (true){
       int n, m; cin >> n >> m;
       if(n == 0 and m == 0) return 0;
       else{
           vector<int> price(n);
           REP(i, n) cin >> price[i];
           int ans = 0;
           REP(i, n){
               REP(j, n){
                   if(j == i) continue;
                   else{
                       int tmp = price[i] + price[j];
                       if(ans < tmp and tmp <= m) ans = tmp;
                   }
               }
           }
           if(ans == 0) cout << "NONE" << endl;
           else cout << ans << endl;
       }
       
   }

}

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>
using namespace std;

int main() {
    while(true){
        int n , m;
        cin >> n>>m;
        vector<int>list(n,0);
        if(n==0&&m==0){break;}
        for(int i =0;i<n;i++){
        cin >>list.at(i);
        }
        int cost = 0;
        for(int i = 0;i<n;i++){
            for(int k = 0;k<n;k++){
                if(list.at(i)+list.at(k)>cost&&list.at(i)+list.at(k)<=m){
                    if(k!=i){
                        cost = list.at(i)+list.at(k);
                        }
                    }
                }
        }
        if(cost==0){cout << "NONE" << endl;}
        else cout << cost << endl;
    }
}