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<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 <iostream>
using namespace std;
int main(void){
    // Your code here!
    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 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 <iostream>
#define N 100000

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


  while(1){
    int p=0,sum=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>=sum&&tmp<=max){
	  sum=tmp;
	  p++; 
	}
      }
    }
    if(p!=0) {
      A[k]=sum;
      k++;
    }else {
      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<iostream>
int maxs(int n,int m,int a[]){
  int maxs=0,flag=0;
  for(int i=0;i<n;i++){
    for(int j=i+1;j<n;j++){

      if(maxs<a[i]+a[j]){
	if(a[i]+a[j]<=m){
	  maxs=a[i]+a[j];
	  flag=1;
	}
      }

    }
  }

  if(flag==1){
    return maxs;
  }else{
    return -1;
  }
}


int main(){

  int n,m,count=0;
  int  b[50000];
  while(n!=0&&m!=0){
    std::cin>>n;
    std::cin>>m;
    if(n==0&&m==0){
      break;
    }
    int a[n];
    for(int i=0;i<n;i++){
      std::cin>>a[i];
    }
    b[count]=maxs(n,m,a);
    count++;
  }
  for(int i=0;i<count;i++){
    if(b[i]==-1){
      std::cout<<"NONE"<<"\n";
    }else{
    std::cout<<b[i]<<"\n";
    }
  }

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

    std::cin>>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;

}

C++: #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = (a); i <= (b); ++i)
#define ll long long

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

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

int a[1000];

int main(void)
{
  while (1) {
    int n, m, max = -1;
    cin >> n >> m;
    if (n == 0) {
      break;
    }
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }

    for (int i = 0; i < n - 1; ++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];
	}
      }
    }
    if (max == -1) {
      cout << "NONE" << endl;
    }
    cout << max << endl;
  }
  return 0;
}

C++: #include <stdio.h>
int max(int a, int b){
    if(a > b)
    return a;
    else
    return b;
}

int main(){
    while(1 == 1){
	int n, m, i, j, k, tmp;
	int result = 0;
	scanf("%d%d", &n, &m);
	if(n == 0 && m ==0)
	    break;
	int a[n];
	for (i = 0; i < n; i++){
		scanf("%d", &a[i]);
	}
	for(int i = 0; i < n; i++){
	    for (j = i + 1; j < n; j++){
	        tmp = a[i] + a[j];
	        if(tmp <= m){
	            result = max(result, tmp);
	        }
	    }
	}
	if(result != 0){
	    printf("%d\n", result);
	}else{
	printf("NONE\n");
    }
    }
	return 0;	
}