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 <algorithm>
#include <vector>
using namespace std;

int main() {
	int n, m;
	while (1) {
		cin >> n >> m;
		if (n == 0 && m == 0)
			break;
		vector<int> price;
		for (int i = 0; i<n; i++) {
			int x;
			cin >> x;
			if (x < m)
				price.push_back(x);
		}

		sort(price.begin(), price.end());

		int max = 0;
		for (int i = 0; i<price.size()/2; i++) {
			for (int j = i + 1; j<price.size(); j++) {
				int sum = price[i] + price[j];
				if (sum <= m && sum >= max) {
					max = sum;
				}
			}
		}
		if (max != 0)
			cout << max << endl;
		else cout << "NONE" << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <limits>
#include <cmath>
#include <cassert>

using namespace std;
using ll = long long;

const int INF = 1<<30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    while(cin >> n >> m, n or m)
    {
        vector<int> A(n);
        for(int i = 0; i < n; i++) cin >> A[i];
        int ans = -1;
        for(int i = 0; i < n; i++)
        {
            for(int j = i + 1; j < n; j++)
            {
                if(A[i] + A[j] > m) continue;
                ans = max(ans, A[i] + A[j]);
            }
        }
        if(ans == -1) cout << "NONE" << endl;
        else cout << ans << endl;
    }
    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<<"NOME"<<endl;
		}
	}

			
	
return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
  int i,n,m,j;
  vector<int> ans;
  while(1){
    cin>>n>>m;
    if(n==0 && m==0) break;
    vector<int> item(n);
    for(i=0; i<n; i++){
      cin>>item[i];
    }
    int max=0;
    int sum;
    for(i=0; i<n; i++){
      for(j=i+1; j<n; j++){
	sum=0;
	sum=item[i]+item[j];
	if(sum>max && sum<m+1){
	  max=sum;
	}
      }
    }
    if(max==0){
      ans.push_back(-1);
    }else{
    ans.push_back(max);
    }
  }
  for(i=0; i<ans.size(); i++){
    if(ans[i]==-1){
      cout<<"NONE";
    }else{
      cout<<ans[i];
    }
    cout<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[])
{
  for(;;) {
    vector<int> as;
    int n, m;
    cin >> n >> m;
    if(n == 0) break;
    for(int i = 0; i < n; i++) {
      int p;
      cin >> p;
      as.push_back(p);
    }
    int mx = -1;
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < n; j++) {
        if(j == i) continue;
        int d = as[i] + as[j];
        if(d > m) continue;
        if(d > mx) mx = d;
      }
    }
    if(mx < 0) {
      cout << "NONE" << endl;
    } else {
      cout << mx << endl;
    }
  }
  return 0;
}