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;
typedef long long LL;
int gcd(int a,int b){if (b == 0) return a; return gcd(b , a%b);}
int lcm(int a, int b){ return a/gcd(a,b)*b;}
int a[10005];
    int n,m;
int low(int val){
    int l = 0,r = n-1;
    while (l!=r) {
        int mid = (r + l) >> 1;
        if (a[mid] >= val) r = mid;
        else l = mid + 1;
    }
    return l;
}
int main(){
    while (scanf("%d%d",&n,&m) == 2 && (n || m)) {
        memset(a, 0, sizeof(a));
        for (int i=0; i<n; i++)
            cin >> a[i];
        LL now = 0,ans = 0;
        sort (a, a+n);
        for (int i=0; i<n; i++) {
            if(m <= a[i]) continue;
            int x = low(m - a[i]);
          //  cout <<x << ' ' << a[x] << ' ' << m - a[i] << ' ' << i  << endl;
            if ((x == 0 && a[x] >= m - a[i])) continue;
            if (x == i && x > 1) x--;
            if (a[x] == m - a[i]) {
                now = a[i] + a[x];
            }else{
                now = a[i] + a[x-1];
            }
            if (now <= m && ans < now) {
                ans = now;
            }
        }
        if (ans == 0) printf("NONE\n");
        else printf("%lld\n",ans);
    }
    return 0;
}

C++: #include <iostream>

int main(void){
  while(1){
    int n , m;
    cin >> n;
    cin >> m;
    if(n == 0 && m == 0){
      return 0;
    }

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

    int sum[n][n];

    for(int i = 0 ; i < n ; i ++){
      for(int j = 0 ; j < n ; j++){
        if(i != j){ sum[i][j] = a[i] + a[j]; }
        else{ sum[i][j] = -1000; }
      }
    }

    int max = -1000;

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

    if(max = -1000){
      cout << "NONE" << endl;
    }else{
      cout << max;
    }
  }

}

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;
using ll = int64_t;
template <typename T> using V = vector<T>;

bool solve() {
    ll N, M;
    cin >> N >> M;
    if(!(N + M)) return false;
    V<ll> A(N);
    for(ll &e : A) cin >> e;
    ll ans = -1;
    for(ll i = 0; i < N; i++) {
        for(ll j = i + 1; j < N; j++) {
            if(A[i] + A[j] > M) continue;
            ans = max(ans, A[i] + A[j]);
        }
    }
    if(ans != -1) cout << ans;
    else cout << "NONE";
    cout << endl;
    return true;
}

int main() {
    while(solve());
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[])
{
    for(;;) {
        int n, m;
        cin >> n >> m;
        if(n == 0 && m == 0) break;
        vector<int> is;
        for(int i = 0; i < n; i++) {
            int c;
            cin >> c;
            is.push_back(c);
        }
        int best = 0;
        for(int i = 0; i < n; i++) {
            for(int j = i+1; j < n; j++) {
                int k = is[i] + is[j];
                if( k <= m && k > best) best = k;
            }
        }
        cout << best << endl;
    }
    return 0;
}

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

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

C++: #include<cstdio>

int main(){
  int n,m;
  int A[10000];
  int max;
  bool flag = 1;

  std::scanf("%d %d",&n,&m);
  
  for(int i = 0;i < n;i++){
    std::scanf("%d",&A[i]);
  }
  
  max = A[0] + A[1];

  if(max < m){
    flag = 0;
  }
  
  for(int i = 0;i < n;i++){
    for(int j = i + 1;j < n;j++){
      if(max < A[i] + A[j] && (A[i] + A[j]) <= m){
	max = A[i] + A[j];
	flag = 0;
      }
    }
  }
  if(!(flag)){
    std::printf("%d\n",max);
  }else{
    std::printf("NONE\n");
  }

  return 0;
}