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);

	ll n, m;
	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];
				}
			}
		}
		if (ans == 0) puts("NONE");
		else cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int t[1005];
int main(){
	int n,m;
	int a,b,c;
	int i,j,k;
	while(cin>>n>>m){
		if(!n)break;
		for(i=0;i<n;i++){
			cin>>t[i];
		}
		b=-1;
		for(i=0;i<n;i++){
			for(j=i+1;j<n;j++){
				a=t[i]+t[j];
				if(a>m)continue;
				if(a>b)b=a;
			}
		}
		if(b==-1)cout<<"NONE"<<endl;
		else cout<<b<<endl;
	}
}

C++: #include<bits/stdc++.h>
#define  INF 1100000000
#define	 MOD 1000000007
using namespace std;


int main(){
	int N, M, ans;
	int a[1100];
	while(1){
		cin >> N >> M;
		if(N==0 && M==0) break; 
		for(int i=0;i<N;i++){
			cin >> a[i];
		}
		ans = -1;
		for(int i=0;i<N;i++){
			for(int j=i+1;j<N;j++){
				if(a[i] + a[j] > ans && a[i] + a[j] <= M){
					ans = a[i] + a[j];
				}	
			
			}
		
		}
		if(ans != -1){
			cout << ans << endl;
		}else{
			cout << "NONE" << endl;
		}
	}
	
	return 0;
	
}

C++: #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;

template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}

constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
constexpr double pi = acos(-1);
constexpr double EPS = 1e-10;

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

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

        int ans = 0;
        for(int i=0; i<n; i++){
            for(int j=i+1; j<n; j++){
                int price = a[i] + a[j];
                if(m < price) continue;
                chmax(ans, price);
            }
        }

        if(ans == 0) cout << "NONE" << endl;
        else cout << ans << endl;
    }
}

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

int main(){
  int n,m;

 while(cin >> n >> m,n!=0){
   int max;
    vector<int> v;
    
    for(int i=0; i<n; ++i){
      int tmp;
      cin >> tmp;
      v.push_back(tmp);
    }

    max = -1;

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

  return 0;
}

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

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

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

int main(){

    int n,m,price,sum,temp_sum;
    sum=0;
    //std::vector<int> prices;
    int prices[1000];

    while(std::cin>>n>>m,n||m){

    for(int i=0;i<n;i++){
        std::cin>>prices[i];
        //prices.push_back(price);
    }

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

    if(sum==0){
        std::cout<<"NONE"<<std::endl;
    }
    else{
        std::cout<<sum<<std::endl;
    }

}

    return 0;

}