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

int main(){
	int n,m,max,tmp,a[1000];
	while(1){
		cin >> n >> m;
		if(n==0&&m==0)break;
		max = 0;

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

		for(int i=0;i++;i<n-1){
			for(int j=1;j++;j<n){
				if(max<a[i]+a[j]&&m>=a[i]+a[j]){
					max = a[i]+a[j];
				}
			}
		}
		if(max==0){
			cout << "NONE" << endl;
			continue;
		}
		cout << max << endl;
	}
}

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    while(1){
        cin >> n >> m;
        if(n + m == 0) break;
        vector<int> a(n);
        rep(i, 0, n){
            cin >> a[i];
        }
        int ans = -1;
        rep(i, 0, n){
            rep(j, i + 1, n){
                int tmp = a[i] + a[j];
                if(tmp <= m){
                    chmax(ans, tmp);
                }
            }   
        }
        if(ans == -1) 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);

        int ans = -1;
        rep(i,n) {
            auto itr = upper_bound(a,a+n,m - a[i]);
            if(itr - a == 0) {
                continue;
            }
            itr--;
            if(*itr == a[i] && c[a[i]] < 2) {
                auto itr2 = lower_bound(a,a+n,a[i]);
                if(itr2 - a == 0) {
                    continue;
                }
                ans = max(ans,*(itr2 - 1) + a[i]);
                continue;
            }
            ans = max(ans,*itr + a[i]);
        }
        if(ans == -1)cout << "NONE" << endl;
        else cout << ans << endl;
    }

    return 0;
}

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

int main(){
	
	while(1){
		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 x=-1;
		for(int i=0;i<n-1;i++){
			for(int j=i+1;j<n;j++){
				int t=a[i]+a[j];
				if(t<=m&&t>x){
					x=t;
				}
			}
		}
		if(x==-1){
			cout<<"NONE";
		}else{
			cout<<x;
		}
		cout<<endl;
	}

	return 0;
}

C++: #include<vector>
#include<list>
#include<map>
#include<climits>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<string>
#include<cstring>
#include<ctime>
#include<queue>
#include<random>
#include<cctype>


using namespace std;

typedef long long ll;
typedef long long LL;

typedef vector<int> VI;
typedef vector<VI> VVI;

int main() {


    while (true)
    {

        int L, Max;
        cin >> L >> Max;
        
        if (L == 0 && Max == 0)
            break;


        VI d(L);
        for (auto& i : d) cin >> i;


        int result = -1;
        for (int i{}; i < L; ++i)
        {
            for (int j{}; j < L; ++j)
            {
                if (i == j) continue;

                auto current = d[i] + d[j];
                if (result < current && current <= Max)
                    result = current;
            }
        }

        if (result == -1)
            cout << "NONE" << endl;
        else
            cout << result << endl;
    }

}

C++: #include <iostream>
#define N 100000

int main(){
  int n=1,max;
  int A[N]={0},k=0;


  while(n!=0){
    int p=0,tmp;
    std::cin>>n;
    int a[n]={0};
    std::cin>>max;
    if(n==0)break;
    for(int i=0;i<n;i++){
      std::cin>>a[i];
    }
    for(int i=0;i<n;i++){
      for(int j=i+1;j<n;j++){
	tmp=a[i]+a[j];
	if(tmp>=A[k]&&tmp<=max){
	  A[k]=tmp;
	  p++; 
	}
      }
    }
    if(p==0) A[k]=0;
    k++;
    //if(p!=0) std::cout<<sum<<"\n";
    //else std::cout<<"NONE\n";
  }
  for(int i=0;i<k;i++){
    if(A[i]!=0){
      std::cout<<A[i]<<"\n";
    }else{
      std::cout<<"NONE\n";
    }
  }



}

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

int main() {
	for (int n, m; cin >> n >> m&&n;) {
		vector<int> a(n);
		int ans = 0;
		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)continue;
			if (a[i] + a[j] > m)continue;
			ans = max(ans, a[i] + a[j]);
		}
		if (ans == 0)cout << "NONE" << endl;
		else cout << ans << endl;
	}
}