package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

type FastScanner struct {
	r *bufio.Reader
}

func NewFastScanner() *FastScanner {
	return &FastScanner{r: bufio.NewReaderSize(os.Stdin, 1<<20)}
}

func (fs *FastScanner) NextInt() int {
	sign, val := 1, 0
	c, _ := fs.r.ReadByte()
	for (c < '0' || c > '9') && c != '-' {
		c, _ = fs.r.ReadByte()
	}
	if c == '-' {
		sign = -1
		c, _ = fs.r.ReadByte()
	}
	for c >= '0' && c <= '9' {
		val = val*10 + int(c-'0')
		c2, err := fs.r.ReadByte()
		if err != nil {
			break
		}
		c = c2
		if c < '0' || c > '9' {
			fs.r.UnreadByte()
			break
		}
	}
	return sign * val
}

func main() {
	in := NewFastScanner()
	out := bufio.NewWriterSize(os.Stdout, 1<<20)
	defer out.Flush()

	t := in.NextInt()
	for ; t > 0; t-- {
		n := in.NextInt()
		k := in.NextInt()
		a := make([]int64, n)
		for i := 0; i < n; i++ {
			a[i] = int64(in.NextInt())
		}

		var ans int64
		if k == 1 {
			var mx1 int64
			for i := 1; i < n; i++ {
				if a[i] > mx1 {
					mx1 = a[i]
				}
			}
			var mx2 int64
			for i := 0; i < n-1; i++ {
				if a[i] > mx2 {
					mx2 = a[i]
				}
			}
			ans = a[0] + mx1
			if v := a[n-1] + mx2; v > ans {
				ans = v
			}
		} else {
			sort.Slice(a, func(i, j int) bool { return a[i] > a[j] })
			for i := 0; i <= k; i++ {
				ans += a[i]
			}
		}

		fmt.Fprintln(out, ans)
	}
}