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

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

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

int main(){
	int n,m,a[1000],dp[1001],b=0;
	dp[0]=0;
	while(1){
		cin>>n,m;
		if(n==0&&m==0)break;
		for(int i=0;i<n;i++)cin>>a[i];
		for(int i=1;i<=n;i++){
			dp[i]=max(dp[i-1],b+a[i-1]);
			b=max(b,a[i-1]);
		}
		cout<<dp[1000]<<endl;
	}
	return 0;
}

C++: 
#include<iostream>
#include<vector>
using namespace std;
int main(){
  int n=1;
  int m=1;
  int count=0;
  vector<int> sum(50000, 0);
  vector<int> flg(50000, 0);

  while(n!=0&&m!=0)
    {
      cin >> n >> m;
      if(n==0&&m==0)
	{
	  break;
	}
      vector<int> a(n);
      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(a[i]+a[j]>sum[count] && a[i]+a[j]<=m && i!=j)
	    {
	      sum[count] = a[i]+a[j];
	      flg[count] = 0;
	    } 
	  else
	    {
	      if(sum[count]==0)
		{
		  flg[count]=1;
		}
	    }
	}
      }
      count++;
    }
  for(int i=0;i<count;i++)
    {
        if(flg[i]==0)
	{
	  cout << sum[i] << endl;
	}
      if(flg[i]==1)
	{
	  cout << "NONE" << endl;
	}
    }
  return 0;
}

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



int main(){
  int n,j,m,i,max;
  int a[1000];
  while(1){
    max=-1;
    cin >> n >> m;
    if(n==0 && m==0){
      break;
    }
    for(i=0;i<n;i++){
      cin >> a[i];
    }
    for(i=0;i<n;i++){
      for(j=0;j<n;j++){
	if(i==j){
	  continue;
	}
	if(a[i]+a[j]<= m && max < a[i]+a[j]){
	  max=a[i]+a[j];
	}
      }
    }
    if(max==-1){
      cout << "NONE" << endl;
    }else{
      cout << max << endl;
    }
  }
  return 0;
	  
	
	  
    
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(void){
    int n,m;
    while(1){
        cin>>n>>m;
        if(n+m==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(m>=a[i]+a[j])ans=max(ans,a[i]+a[j]);
            }
        }
        if(ans==-1)cout<<"NONE"<<endl;
        else cout<<ans<<endl;
    }
    return 0;
}

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

using namespace std;

int main(){

  int n=1,kakaku=1,min1,min2=1000000,a,b,c,i,j,k=0;
  vector<int> min3(50000,10000000);
  while(n!=0&&kakaku!=0){
    min2=1000000;
    cin>>n;
    vector<int> s(n);
    cin>>kakaku;

    for(i=0;i<n;i++){
      cin>>s.at(i);
    }

    for(i=0;i<n;i++){
      for(j=0;j<n;j++){
	if(i!=j){
	  a=s.at(i);
	  b=s.at(j);
	  c=a+b;
	  min1=kakaku-c;
	  if(min2>min1&&min1>=0){
	    min2=min1;
	    min3[k]=c;
	  }
	}
      }
    }
    k++;
  }
  for(i=0;i<k-1;i++){
    if(min3.at(i)==10000000){
      cout<<"NONE"<<endl;
    }else{
      cout<<min3.at(i)<<endl;
    }
  }
  return 0;
}

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

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