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<bits/stdc++.h>
using namespace std;

bool isprime(long long int val) {
    if (val <= 1)return false;
    for (long long int i = 2; i*i <= val; i++) {
        if (val%i == 0LL)return false;
    }
    return true;
}

int main(){
    ios::sync_with_stdio(false);
	cin.tie(0);

    vector<int> db;
    int n,p;
    while(cin>>n>>p){
        if(n==-1) break;
        vector<int> v;
        vector<int> ans;
        for(int i=1;v.size()<=100;i++){
            if(isprime(n+i)){
                v.push_back(n+i);
            }
        }
        int m = v.size();
        for(int i=0;i<m;i++){
            for(int j=i;j<m;j++){
                ans.push_back(v[i]+v[j]);
            }
        }
        sort(ans.begin(),ans.end());
        cout << ans[p-1] << endl;
        db.push_back(ans[p-1]);
    }

    //for(auto i:db) cerr<<i<<" ";


}

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

using namespace std;

int main(){

	int hurui[200000]={0};
	int sosuu[100000];
	int cnt=0;
	vector<int> retu;
	int N,P;

	for(int i=2;i<=200000;i++){
		if(hurui[i]==0){
			sosuu[cnt]=i;
			cnt++;
			for(int j=i;j<=200000;j+=i){
				hurui[j]=1;
			}
		}
	}

	while(1){
		cin>>N>>P;
		if(N==-1&&P==-1) break;
		for(int i=0;;i++){
			if(sosuu[i]>N){
				for(int j=0;j<P;j++){
					for(int k=j;k<P+1;k++){
						retu.push_back(sosuu[i+j]+sosuu[i+k]);
					}
				}
				break;
			}
		}
		sort(retu.begin(),retu.end());
		cout<<retu[P-1]<<endl;
		retu.clear();
	}
}

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

#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
#define fcout cout << setprecision(10)

const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;

using namespace std;

template <typename T>
void debug(vector<T> &vec) {
    for (auto x : vec) {
        cout << x << " ";
    }
    cout << endl;
    return;
}

template<typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

template <typename T>
int getFormer(const vector<T> &vec, T x) {
    return upper_bound(vec.begin(), vec.end(), x) - vec.begin() - 1;
}

template <typename T>
int getLatter(const vector<T> &vec, T x) {
    return lower_bound(vec.begin(), vec.end(), x) - vec.begin();
}

vector<long long> era(int N) {
    vector<bool> isPrime(N, true);
    vector<long long> res;
    isPrime[0] = isPrime[1] = false;
    for (int i = 2; i < sqrt(N) + 1; i++) {
        if (isPrime[i] == true) {
            for (int j = i + i; j < N + 1; j += i){
                isPrime[j] = false;
            }
        }
    }

    for (int i = 2; i < N + 1; i++) {
        if (isPrime[i] == true) res.push_back(i);
    }

    return res;
}

vector<long long> primes;

int solve(int N, int P) {
    auto s = lower_bound(ALL(primes), N) - primes.begin();
    vector<long long> sums;
    for (int i = s; i < s + P + 1; i++) {
        for (int j = i; j < s + P + 1; j++) {
            sums.push_back(primes[i] + primes[j]);
        }
    }

    sort(ALL(sums));
    cout << sums[P - 1] << endl;
}

int main() {
    int N, P;
    primes = era(3 * 1e5);
    while (cin >> N >> P && N != -1) {
        solve(N, P);
    }
    return 0;
}

C++: #include <vector>
#include <iostream>
#include <algorithm>
 
using namespace std;
 
bool is_prime(int n, int k = 3)
{
    if(n < k * k) { return true; }
     
    if(n % k == 0) { return false; }
     
    return is_prime(n, k + 2);
}
 
int main()
{
    vector<int> prime = {2};
     
    for(int i = 3; i < 101300; 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; int r = min(21, m) - 1;
        
        for(int i = ptr + r; i >= ptr; i--)
        {
            for(int j = ptr + r; j >= i; j--)
            {
                c.push_back(prime[i] + prime[j]);
            }
        }
        
        sort(c.begin(), c.end());
         
        printf("%d\n", c[m - 1]);
    }
     
    return 0;
}