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(){
	int n,m,max,tmp,a[1000];
	while(1){
		cin >> n >> m;
		if(n==0&&m==0)break;
		max = 0;

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

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

C++: #include<stdio.h>

int main()
{
	int n=1,m=1;
	int obj[1001],max,min,temp=0;
	while(1)
	{
		max=0;
		min=2000000;
		
		scanf("%d",&n);
		scanf("%d",&m);
		
		if(n==0 && m==0) break;
		
		for(int i=0;i<n;i++)
		{
			scanf("%d",&obj[i]);
		}
		for(int i=0;i<n;i++)
		{
			for(int t=i+1;t<n;t++)
			{
				temp=obj[i]+obj[t];
				if(temp>max && temp<=m) max=temp;
				if(temp<min) min=temp;
			}
		}
		if(min>m) printf("NONE\n");
		else printf("%d\n",max);
	}
	
	return 0;
}

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

int main(){
	int n,m,max,tmp,a[1000];
	while(1){
		cin >> n >> m;
		if(n==0&&m==0)break;
		max = 0;

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

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

C++: #include "stdafx.h"
#include <iostream>
#include <string>
using namespace std;

	static int n, m, ans;
	static int a[100000];
void input() {
	cin >> n;
	cin >> m;
	for (int i = 1; i < n + 1; i++) {
		cin >> a[i];
	}
}
void pre() {
	ans = 0;
}
void operate() {
	for (int i=1;i<n+1;i++) 
		for (int j = i + 1; j < n + 1; j++) {
			if ((a[i] + a[j] <= m)&(a[i] + a[j] > ans)) ans = a[i] + a[j];
		}
}
void output() {
	if (ans == 0) cout << "NONE";
	else cout << ans;
	cout << endl;
}
int main() {
	while (true) {
		input();
		if (n == 0)return 0;
		pre();
		operate();
		output();
	}
	return(0);
}

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

int main(){
    int n,m;
    int tmp;
    int ans;
    std::vector<int> p;
    std::cin >> n;
    std::cin >> m;

    while(n!=0 && m!=0){
        ans =-1;
        for(int i=0;i<n;i++){
            std::cin >> tmp;
            p.push_back(tmp);
        }
        for(int i=0;i<n-1;i++){
            for(int j=i+1;j<n;j++){
                if(p[i] + p[j] <= m){
                    if(p[i] + p[j] > ans){
                        ans = p[i] + p[j];
                    }
                }
            }
        }
        if(ans==-1){
            std::cout << "NONE\n";
        }else{
            std::cout << ans <<"\n";
        }
        std::cin >> n;
        std::cin >> m;
    }
    return 0;
}

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

int main(){

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

    n=m=1;

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

    std::cin>>n>>m;

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

    for(int i=0;i<n;i++){
        for(int j=0;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 <iostream>

using namespace std;

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

		int ans = -1;
		for(int i=0; i<n-1; i++){
			for(int j=i+1; j<n; j++){
				int tmp = a[i] + a[j];
				if(ans < tmp && tmp <= m) ans = tmp;
			}
		}

		if(ans != -1) cout << ans << endl;
		else cout << "NONE" << endl;
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

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>
using namespace std;
int main(){
  int n,m,b,max=0;
  while(1){
    max=0;
    cin>>n>>m;
    if(n==0&&m==0){
      break;
    }
    int a[n];
    for(int i=0;i<n;i++){
      cin>>a[i];
    }
  
    for(int j=0;j<n;j++){
      for(int k=0;k<n;k++){
	  if(max<a[j]+a[k] && a[j]+a[k]<=m&&j!=k){
	    max=a[j]+a[k];
	    cout<<max<<"\n";
	  }
      }
    }
    if(max==0){
      cout<<"NONE"<<endl;
    }else{
      cout<<max<<endl;
    }
  }
}

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

int main(void){
  int n, m;
  while(cin >> n >> m, n){
    vector<int> a(n);
    for(auto& _a: a){
      cin >> _a;
    }
    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;
}