Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		n, p := io.NextInt(), io.NextInt()
		if n == -1 {
			break
		}
		isPrime := SieveOpt(200000)
		prime := make([]int, p)
		cnt := 0
		if n < 2 {
			prime[0] = 2
			cnt++
		}
		for i := (n + 1) / 2; i < len(isPrime) && cnt < p; i++ {
			if isPrime[i] == true {
				prime[cnt] = 2*i + 1
				cnt++
			}
		}
		comb := make([]int, 0, p*p)
		for i := 0; i < p; i++ {
			for j := i; j < p; j++ {
				comb = append(comb, prime[i]+prime[j])
			}
		}
		sort.Ints(comb)
		io.Println(comb[p-1])
	}
}

func SieveOpt(x int) []bool {
	flags := make([]bool, x/2) // flags[i] := 2*j+1 is prime
	for i := 1; i < x/2; i++ {
		flags[i] = true
	}
	sqrtXi := int(math.Ceil(math.Sqrt(float64(x)))) / 2
	for i := 1; i < sqrtXi; i ++ {
		if !flags[i] {
			continue
		}
		for j := 2 * i * (i + 1); j < x/2; j += 2*i + 1 {
			flags[j] = false
		}
	}
	return flags
}

// 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 <vector>
#include <iostream>
#include <algorithm>

using namespace std;

bool is_prime(int n, int k = 2)
{
    if(n < k * k) { return true; }
    
    if(n % k == 0) { return false; }
    
    return is_prime(n, k + 1);
}

int main()
{
    vector<int> prime = {2};
    
    for(int i = 3; i < 105000; i += 2)
    {
        if(is_prime(i))
        {
            prime.push_back(i);
        }
    }
    
    int n, m;
    
    while(true)
    {
        scanf("%d", &n);
        scanf("%d", &m);
        
        if(n == -1 && m == -1) { break; }
        
        int ptr = distance(prime.begin(), lower_bound(prime.begin(), prime.end(), n + 1));
        
        vector<int> c;
        
        for(int i = ptr; i < ptr + m; i++)
        {
            for(int j = i; j < ptr + m; j++)
            {
                c.push_back(prime[i] + prime[j]);
            }
        }
        
        sort(c.begin(), c.end());
        
        printf("%d\n", c[m - 1]);
    }
    
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

bool isPrime(int n){
	if(n < 2) return false;
	for(int i=2;i<=sqrt(n);i++){
		if(n%i==0) return false;
	}
	return true;
}

int main(){
	int n,p;
	while(cin >> n >> p,n!=-1){
		vector<int> primes;
		for(int i=n+1;primes.size()<=100;i++){
			if(isPrime(i)) primes.emplace_back(i);
		}
		vector<int> cc;
		for(int unsigned i = 0;i<primes.size();i++){
			for(int unsigned j = i;j<primes.size();j++){
				cc.emplace_back(primes[i]+primes[j]);
			}
		}
		sort(cc.begin(),cc.end());
		cout << cc[p-1] << endl;
	}
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX = 1e6;

bool prime[MAX];

void is_prime(){
  fill(prime,prime+MAX,true);
  
  prime[0] = prime[1] = false;
  for(int i = 2 ; i*i < MAX ; i++)
    if(prime[i])
      for(int j = i*i ; j < MAX ; j += i)
	prime[j] = false;
}

int main(){
  int n,p;

  is_prime();

  while(true){
    cin >> n >> p;
    if(n == -1 && p == -1) break;

    vector<int> v;
    for(int i = n+1 ; i < n+500 ; i++){
      if(prime[i]) v.push_back(i);
    }

    vector<int> ans;
    for(int i = 0 ; i < (int)v.size() ; i++){
      for(int j = i ; j < (int)v.size() ; j++){
	ans.push_back(v[i]+v[j]);
      }
    }
    sort(ans.begin(),ans.end());

    cout << ans[p-1] << endl;
  }  

  return 0;
}

C++: #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};

int main() {
	vector<bool> a(200000, true);
	a[0] = a[1] = false;
	for (int i = 2; i < 200000; i++)
		if (a[i])
			for (int j = i * 2; j < 200000; j += i)
				a[j] = false;
	vector<int> p;
	for (int i = 0; i < 200000; i++)
		if (a[i]) p.push_back(i);
	for (;;) {
		int N, P; cin >> N >> P;
		if (N == -1) break;
		int k = upper_bound(p.begin(), p.end(), N) - p.begin();
		vector<int> v;
		for (int i = 0; i < P; i++)
			for (int j = i; j < P; j++)
				v.push_back(p[k + i] + p[k + j]);
		sort(v.begin(), v.end());
		cout << v[P - 1] << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  int a[10000]={2,3},i,j,k,c=2,b[120000][250],q;
  for(i=4;i<1000000;i++){
    for(k=1,j=2;j*j<=i;j++){
      if(i%j==0){k=0;break;}
    }
    if(k)a[c++]=i;
  }k=0;
  for(i=0;i<120000;i++){
    if(i>a[k])k++;
    for(q=0,j=k;j<k+14;j++){
      for(c=k;c<k+14;c++){
        b[i][q++]=a[j]+a[c];
      }
    }
    sort(b[i],b[i]+196);
  }
  while(cin>>i>>j,i||j)cout<<b[i][j]<<endl;
}

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

using namespace std;

void eratosthenes(vector<int> &n){	
	n[1] = 1;
	for (int i = 2;i <= (120000/2); i++){
		n[i * 2] = 1;
	}
	int p = 3;
	while(p * p <= 120000){
		for (int i = p; i <= (120000/p); i++){
			n[i * p] = 1;
		}
		p++;
		while(n[p] == 1)p++;
	}
	return;
}

bool isPrime(int n){
	if (n < 2) return false;
	if (n == 2) return true;
	for (int i = 2; i <= sqrt(n) + 1; i++){
		if (n % i == 0) return false;
	}
	return true;
}
		
int main(){
	vector<int> era(120000);
	eratosthenes(era);
	vector<int> Primelist(120001);
	int index = 1;
	for (int i = 1; i <= era.size(); i++){
		if (era[i] == 0){
			Primelist[index] = i;
			index++;
		}
	}
	while(1){
		int n,p; cin >> n >> p;
		if (n + p == -2) break;
		index = 1;
		while(n >= Primelist[index]){
			index++;
		}
		
		vector<int> list(120000);
		for (int i = 1; i <= p; i++){
			for (int j = i; j <= p; j++){
				list[(i-1) * p + j] = Primelist[index + i - 1] + Primelist[index + j - 1];
			}
		}
		sort(list.begin(),list.end());
		index = 0;
		while(list[index] == 0){
			index++;
		}
		cout << list[index + p - 1] << endl;
		
	}

return 0;
}