using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;

namespace cf575
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_cf575B();
        }

        public static void solve_cf575B()
        {
            int q = Convert.ToInt32(Console.ReadLine());
            for (int tt = 0; tt < q; tt++)
            {
                int[] nk = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
                int n = nk[0];
                int k = nk[1];
                int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
                int cnt = 0;
                List<int> idxs = new List<int>();

                for (int i = 0; i < n; i++)
                {
                    if (a[i] % 2 != 0)
                    {
                        cnt++;
                        idxs.Add(i);
                    }
                }
                if (cnt >= k)
                {
                    int r = cnt % k;
                    if ((cnt % 2 == 0 && k != 1) || r % 2 == 0)
                    {
                        Console.WriteLine("YES");
                        int j = 0;
                        while (j < k)
                        {
                            Console.Write("{0} ", j == k - 1 ? n : idxs[j] + 1);
                            j++;
                        }
                        Console.WriteLine();
                    }
                    else
                    {
                        Console.WriteLine("NO");
                    }

                }
                else
                {
                    Console.WriteLine("NO");
                }
                /*
                1) even (numerator)/even(denominator) = d1 =1, d2 = 1, ..., dk
                we take k - 1 groups and multiply them by the difference of quotinent - 1.
                and then we add the result to dk.
                Final formula:
                k + (k - 1) * (quotinent - 1);
                All parts until dk will be set to one.
                Example:
                8 (even numerator) / 4 (even denominator) = 2 (quotinent)
                group d1 = 1, group d2 = 1, droup d3 = 1, and group d4 = 2 + (4 - 1) * 1 = 5
                2) even (numerator) / odd(denominator) = if we deduct odd number from even number we always have odd number
                */
            }
        }

        public static void solve_cf575A()
        {
        }
    }
}


using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;

namespace _1000
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_575B();
        }

        public static void solve_575B()
        {
            int q = Convert.ToInt32(Console.ReadLine());
            for (int i = 0; i < q; i++)
            {
                string[] nk = Console.ReadLine().Split(' ');

                int n = Convert.ToInt32(nk[0]);
                int k = Convert.ToInt32(nk[1]);

                string[] test = Console.ReadLine().Split(' ');

                long[] pref = new long[n];

                pref[0] = Convert.ToInt64(test[0]);
                for (int j = 1; j < n; j++)
                {
                    pref[j] = Convert.ToInt64(test[j]) + pref[j - 1];
                }

                List<int> idxs = new List<int>();

                int count = 0;
                int curIdx = 0;
                int lastIdx = 0;
                while (curIdx < pref.Length)
                {
                    if (count == k - 1)
                    {
                        curIdx = pref.Length - 1;
                    }

                    if (count < k)
                    {
                        if ((curIdx == 0 && pref[curIdx] % 2 != 0) || (pref[curIdx] - pref[lastIdx]) % 2 != 0)
                        {

                            idxs.Add(curIdx + 1);
                            lastIdx = curIdx;
                            count++;
                        }
                    }
                    curIdx++;
                }

                if (count == k)
                {
                    Console.WriteLine("YES");
                    string output = String.Empty;
                    for (int z = 0; z < idxs.Count; z++)
                    {
                        output += idxs[z] + " ";
                    }
                    Console.WriteLine(output);
                }
                else
                {
                    Console.WriteLine("NO");
                }
            }
        }

        public static void solve_575A()
        {
            int q = Convert.ToInt32(Console.ReadLine());

            for (int i = 0; i < q; i++)
            {
                string[] test = Console.ReadLine().Split(' ');

                long sum = 0;

                for (int j = 0; j < test.Length; j++)
                {
                    sum += Convert.ToInt64(test[j]);
                }

                long answer = sum / 2;//sum % 2 == 0 ? sum / 2 : (sum / 2) - 1;

                Console.WriteLine(answer);

            }
        }

        /*
        Not solved yet.
        */
        public static void solve_69C()
        {
            string[] nk = Console.ReadLine().Split(' ');
            int n = Convert.ToInt32(nk[0]);
            int k = Convert.ToInt32(nk[1]);

            string[] test = Console.ReadLine().Split(' ');

            int[] pref = new int[n];

            pref[0] = Convert.ToInt32(test[0]);
            for (int i = 1; i < n; i++)
            {
                int cur = Convert.ToInt32(test[i]);
                pref[i] += cur;
            }

        }

        public static void solve_69B()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            List<KeyValuePair<int, int>> sortedTowers = new List<KeyValuePair<int, int>>();
            string[] test = Console.ReadLine().Split(' ');
            for (int i = 0; i < test.Length; i++)
            {
                sortedTowers.Add(new KeyValuePair<int, int>(i, Convert.ToInt32(test[i])));
            }
            sortedTowers.Sort((a, b) => b.Value.CompareTo(a.Value));

            string answer = "yes";
            int top = sortedTowers[0].Key;
            int[] used = new int[n];
            int count = 1;
            for (int i = 1; i < sortedTowers.Count; i++)
            {
                int cur = sortedTowers[i].Key;

                if (Math.Abs(top - cur) == 1 || used[Math.Abs(cur - 1)] == 1 || used[cur < n - 1 ? cur + 1 : cur] == 1)
                {
                    used[cur] = 1;
                    count++;
                }
            }

            if (count != n)
            {
                answer = "no";
            }
            Console.WriteLine(answer);
        }

        public static void solve_69A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            for (int i = 0; i < n; i++)
            {
                int k = Convert.ToInt32(Console.ReadLine());

                string[] test = Console.ReadLine().Split(' ');
                int[] sticks = Array.ConvertAll(test, int.Parse);

                Array.Sort(sticks, (int a, int b) => b.CompareTo(a));

                int longStick = sticks[1];
                int count = 0;
                for (int j = sticks.Length - 1; j >= 2; j--)
                {
                    if (longStick > 1)
                    {
                        count++;
                        longStick--;
                    }
                }

                Console.WriteLine(count);
            }
        }

        public static void solve_164A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            int i = 2;
            int total = n;
            int len = n;
            while (--len > 1)
            {
                total += i * (len - 1);
                total += 1;
                i++;

            }
            total += n > 1 ? 1 : 0;

            Console.WriteLine(total);
        }

        public static void solve_betaRound9A()
        {
            string[] yw = Console.ReadLine().Split(' ');

            int y = Convert.ToInt32(yw[0]);
            int w = Convert.ToInt32(yw[1]);

            int diff = 6 - Math.Max(y, w) + 1;
            int numerator = diff == 4 ? 2 : diff == 5 ? 5 : 1;
            int nominator = 6 % diff == 0 ? 6 / diff : diff == 4 ? 3 : 6;
            Console.WriteLine("{0}/{1}", numerator, nominator);
        }

        public static void solve_531A()
        {
            long n = Convert.ToInt32(Console.ReadLine());

            Console.WriteLine((n * (n + 1) / 2) % 2 == 0 ? 0 : 1);
        }

        /*
            The issue here is that you cannot easily calculate 2 to the power to 10000000.
            For that you need big arhithmetique techniques. And even this may not help
            because you need to quickly calculate powers of 2 and then you need to divide
            big integer by short integer values.
            But if you look into the problem you can actually observe that m
            can only give differnt reminders if it is less than n. If n is larger than m
            then you always have the reminder m. Furthermore, we can see by the problem
            statement that m can be maximum 8-digit number. So in order to calculate
            different reminders n must be less then 27). Why 27.
            Well, we know that (2^31) - 1 is the upper integer range int c#. And it is a 10
            digit number. Let't decrease 31 by 1 to see when we have an integer with 8 digits.
            Using calculator it's pretty easy.
         */
        public static void solve_hello2018A()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            int m = Convert.ToInt32(Console.ReadLine());
            int answer = 0;
            if (n >= 27)
            {
                answer = m;
            }
            else
            {
                answer = m % Convert.ToInt32(Math.Pow(2, n));
            }

            Console.WriteLine(answer);
        }

        public static void solve_337A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            int answer = 0;

            if (n % 2 == 0)
            {
                //better formula by editorial
                answer = n % 4 == 0 ? (n / 4) - 1 : n / 4;
                //answer = (n / 2) % 2 == 0 ? ((n / 2) - 2) / 2 : (n - ((n / 2) + 1)) / 2;
            }

            Console.WriteLine(answer);
        }
        public static void solve_574B()
        {
            string[] nk = Console.ReadLine().Split(' ');
            int n = Convert.ToInt32(nk[0]);
            int k = Convert.ToInt32(nk[1]);

            int i = 1;
            int count = 1;
            while (i != n && i - count == k)
            {
                i++;
                count += count + 1;
            }

            Console.WriteLine(count);
        }

        public static void solve_574A()
        {
            string[] nk = Console.ReadLine().Split(' ');
            int n = Convert.ToInt32(nk[0]);
            int k = Convert.ToInt32(nk[1]);

            int[] cnt = new int[k];
            for (int i = 0; i < n; i++)
            {
                int p = Convert.ToInt32(Console.ReadLine());

                cnt[p - 1]++;
            }

            Array.Sort(cnt, (int a, int b) => b.CompareTo(a));
            int count = 0;
            int g = 0;
            int j = n % 2 > 0 ? n / 2 + 1 : n / 2;
            for (int i = 0; i < k; i++)
            {
                if (g >= j)
                {
                    break;
                }

                while (cnt[i] > 0 && g < j)
                {
                    int deduct = cnt[i] > 1 ? 2 : 1;
                    cnt[i] -= deduct;
                    count += deduct;
                    g += 1;
                }
                //int deduct = cnt[i] % 2 > 0 ? cnt[i] / 2 + 1 : cnt[i] / 2;
                /*if (j <= 0)
                {
                    break;
                }
                if (j == 1 && deduct > 1)
                {
                    count += 2;
                }
                else if (j == 1 && deduct == 1)
                {
                    count += 1;
                }
                else
                {
                    count += cnt[i];
                }

                j -= deduct;*/
            }

            Console.WriteLine(count);
        }

        public static void solve_352B()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            string test = Console.ReadLine();
            int[] cnts = new int[123];

            for (int i = 0; i < n; i++)
            {
                cnts[test[i]]++;
            }

            int unq = 0;
            for (int i = 0; i < cnts.Length ;i++)
            {
                if (cnts[i] > 0)
                {
                    unq++;
                }
            }

            int answer = -1;

            //Redundancy in condition. if n must be <= 26 then of course unq will be <= 26. So we can remove it.
            if (unq <= 26 && n <= 26)
            {
                answer = n - unq;
            }

            Console.WriteLine(answer);
        }

        public static void solve_2A()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            string[] test = Console.ReadLine().Split(' ');

            int max = int.MinValue;
            int maxI = 0;
            int min = int.MaxValue;
            int minI = 0;
            for (int i = 0; i < n; i++)
            {
                int num = Convert.ToInt32(test[i]);
                if (max < num)
                {
                    max = num;
                    maxI = i;
                }

                if (min > num)
                {
                    min = num;
                    minI = i;
                }
            }

            //n - 1 - because index starts at 0 and ends at n - 1
            // or we could add +1 to minI and maxI and count from 1.
            Console.WriteLine(Math.Abs(minI - maxI) + Math.Max(n - 1 - Math.Max(minI, maxI), Math.Min(minI, maxI)));
        }
        public static void solve_360B()
        {
            string n = Console.ReadLine();

            Console.WriteLine(n + String.Join("", n.Reverse().ToList()));
        }
    }
}


using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;

namespace _1000
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_575B();
        }

        public static void solve_575B()
        {
            int q = Convert.ToInt32(Console.ReadLine());
            for (int i = 0; i < q; i++)
            {
                string[] nk = Console.ReadLine().Split(' ');

                int n = Convert.ToInt32(nk[0]);
                int k = Convert.ToInt32(nk[1]);

                string[] test = Console.ReadLine().Split(' ');

                long[] pref = new long[n];

                pref[0] = Convert.ToInt64(test[0]);
                for (int j = 1; j < n; j++)
                {
                    pref[j] = Convert.ToInt64(test[j]) + pref[j - 1];
                }

                List<int> idxs = new List<int>();

                int count = 0;
                int curIdx = 0;
                int lastIdx = 0;
                if (pref[0] % 2 != 0)
                {
                    count = 1;
                    curIdx = 1;
                    lastIdx = 0;
                    idxs.Add(curIdx);
                }

                while (curIdx < pref.Length)
                {
                    if (count == k - 1)
                    {
                        curIdx = pref.Length - 1;
                    }

                    if (count < k)
                    {
                        if (curIdx > 0 && (pref[curIdx] - pref[lastIdx]) % 2 != 0)
                        {

                            idxs.Add(curIdx + 1);
                            lastIdx = curIdx;
                            count++;
                        }
                    }
                    curIdx++;
                }

                if (count == k)
                {
                    Console.WriteLine("YES");
                    string output = String.Empty;
                    for (int z = 0; z < idxs.Count; z++)
                    {
                        output += idxs[z] + " ";
                    }
                    Console.WriteLine(output);
                }
                else
                {
                    Console.WriteLine("NO");
                }
            }
        }

        public static void solve_575A()
        {
            int q = Convert.ToInt32(Console.ReadLine());

            for (int i = 0; i < q; i++)
            {
                string[] test = Console.ReadLine().Split(' ');

                long sum = 0;

                for (int j = 0; j < test.Length; j++)
                {
                    sum += Convert.ToInt64(test[j]);
                }

                long answer = sum / 2;//sum % 2 == 0 ? sum / 2 : (sum / 2) - 1;

                Console.WriteLine(answer);

            }
        }

        /*
        Not solved yet.
        */
        public static void solve_69C()
        {
            string[] nk = Console.ReadLine().Split(' ');
            int n = Convert.ToInt32(nk[0]);
            int k = Convert.ToInt32(nk[1]);

            string[] test = Console.ReadLine().Split(' ');

            int[] pref = new int[n];

            pref[0] = Convert.ToInt32(test[0]);
            for (int i = 1; i < n; i++)
            {
                int cur = Convert.ToInt32(test[i]);
                pref[i] += cur;
            }

        }

        public static void solve_69B()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            List<KeyValuePair<int, int>> sortedTowers = new List<KeyValuePair<int, int>>();
            string[] test = Console.ReadLine().Split(' ');
            for (int i = 0; i < test.Length; i++)
            {
                sortedTowers.Add(new KeyValuePair<int, int>(i, Convert.ToInt32(test[i])));
            }
            sortedTowers.Sort((a, b) => b.Value.CompareTo(a.Value));

            string answer = "yes";
            int top = sortedTowers[0].Key;
            int[] used = new int[n];
            int count = 1;
            for (int i = 1; i < sortedTowers.Count; i++)
            {
                int cur = sortedTowers[i].Key;

                if (Math.Abs(top - cur) == 1 || used[Math.Abs(cur - 1)] == 1 || used[cur < n - 1 ? cur + 1 : cur] == 1)
                {
                    used[cur] = 1;
                    count++;
                }
            }

            if (count != n)
            {
                answer = "no";
            }
            Console.WriteLine(answer);
        }

        public static void solve_69A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            for (int i = 0; i < n; i++)
            {
                int k = Convert.ToInt32(Console.ReadLine());

                string[] test = Console.ReadLine().Split(' ');
                int[] sticks = Array.ConvertAll(test, int.Parse);

                Array.Sort(sticks, (int a, int b) => b.CompareTo(a));

                int longStick = sticks[1];
                int count = 0;
                for (int j = sticks.Length - 1; j >= 2; j--)
                {
                    if (longStick > 1)
                    {
                        count++;
                        longStick--;
                    }
                }

                Console.WriteLine(count);
            }
        }

        public static void solve_164A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            int i = 2;
            int total = n;
            int len = n;
            while (--len > 1)
            {
                total += i * (len - 1);
                total += 1;
                i++;

            }
            total += n > 1 ? 1 : 0;

            Console.WriteLine(total);
        }

        public static void solve_betaRound9A()
        {
            string[] yw = Console.ReadLine().Split(' ');

            int y = Convert.ToInt32(yw[0]);
            int w = Convert.ToInt32(yw[1]);

            int diff = 6 - Math.Max(y, w) + 1;
            int numerator = diff == 4 ? 2 : diff == 5 ? 5 : 1;
            int nominator = 6 % diff == 0 ? 6 / diff : diff == 4 ? 3 : 6;
            Console.WriteLine("{0}/{1}", numerator, nominator);
        }

        public static void solve_531A()
        {
            long n = Convert.ToInt32(Console.ReadLine());

            Console.WriteLine((n * (n + 1) / 2) % 2 == 0 ? 0 : 1);
        }

        /*
            The issue here is that you cannot easily calculate 2 to the power to 10000000.
            For that you need big arhithmetique techniques. And even this may not help
            because you need to quickly calculate powers of 2 and then you need to divide
            big integer by short integer values.
            But if you look into the problem you can actually observe that m
            can only give differnt reminders if it is less than n. If n is larger than m
            then you always have the reminder m. Furthermore, we can see by the problem
            statement that m can be maximum 8-digit number. So in order to calculate
            different reminders n must be less then 27). Why 27.
            Well, we know that (2^31) - 1 is the upper integer range int c#. And it is a 10
            digit number. Let't decrease 31 by 1 to see when we have an integer with 8 digits.
            Using calculator it's pretty easy.
         */
        public static void solve_hello2018A()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            int m = Convert.ToInt32(Console.ReadLine());
            int answer = 0;
            if (n >= 27)
            {
                answer = m;
            }
            else
            {
                answer = m % Convert.ToInt32(Math.Pow(2, n));
            }

            Console.WriteLine(answer);
        }

        public static void solve_337A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            int answer = 0;

            if (n % 2 == 0)
            {
                //better formula by editorial
                answer = n % 4 == 0 ? (n / 4) - 1 : n / 4;
                //answer = (n / 2) % 2 == 0 ? ((n / 2) - 2) / 2 : (n - ((n / 2) + 1)) / 2;
            }

            Console.WriteLine(answer);
        }
        public static void solve_574B()
        {
            string[] nk = Console.ReadLine().Split(' ');
            int n = Convert.ToInt32(nk[0]);
            int k = Convert.ToInt32(nk[1]);

            int i = 1;
            int count = 1;
            while (i != n && i - count == k)
            {
                i++;
                count += count + 1;
            }

            Console.WriteLine(count);
        }

        public static void solve_574A()
        {
            string[] nk = Console.ReadLine().Split(' ');
            int n = Convert.ToInt32(nk[0]);
            int k = Convert.ToInt32(nk[1]);

            int[] cnt = new int[k];
            for (int i = 0; i < n; i++)
            {
                int p = Convert.ToInt32(Console.ReadLine());

                cnt[p - 1]++;
            }

            Array.Sort(cnt, (int a, int b) => b.CompareTo(a));
            int count = 0;
            int g = 0;
            int j = n % 2 > 0 ? n / 2 + 1 : n / 2;
            for (int i = 0; i < k; i++)
            {
                if (g >= j)
                {
                    break;
                }

                while (cnt[i] > 0 && g < j)
                {
                    int deduct = cnt[i] > 1 ? 2 : 1;
                    cnt[i] -= deduct;
                    count += deduct;
                    g += 1;
                }
                //int deduct = cnt[i] % 2 > 0 ? cnt[i] / 2 + 1 : cnt[i] / 2;
                /*if (j <= 0)
                {
                    break;
                }
                if (j == 1 && deduct > 1)
                {
                    count += 2;
                }
                else if (j == 1 && deduct == 1)
                {
                    count += 1;
                }
                else
                {
                    count += cnt[i];
                }

                j -= deduct;*/
            }

            Console.WriteLine(count);
        }

        public static void solve_352B()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            string test = Console.ReadLine();
            int[] cnts = new int[123];

            for (int i = 0; i < n; i++)
            {
                cnts[test[i]]++;
            }

            int unq = 0;
            for (int i = 0; i < cnts.Length ;i++)
            {
                if (cnts[i] > 0)
                {
                    unq++;
                }
            }

            int answer = -1;

            //Redundancy in condition. if n must be <= 26 then of course unq will be <= 26. So we can remove it.
            if (unq <= 26 && n <= 26)
            {
                answer = n - unq;
            }

            Console.WriteLine(answer);
        }

        public static void solve_2A()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            string[] test = Console.ReadLine().Split(' ');

            int max = int.MinValue;
            int maxI = 0;
            int min = int.MaxValue;
            int minI = 0;
            for (int i = 0; i < n; i++)
            {
                int num = Convert.ToInt32(test[i]);
                if (max < num)
                {
                    max = num;
                    maxI = i;
                }

                if (min > num)
                {
                    min = num;
                    minI = i;
                }
            }

            //n - 1 - because index starts at 0 and ends at n - 1
            // or we could add +1 to minI and maxI and count from 1.
            Console.WriteLine(Math.Abs(minI - maxI) + Math.Max(n - 1 - Math.Max(minI, maxI), Math.Min(minI, maxI)));
        }
        public static void solve_360B()
        {
            string n = Console.ReadLine();

            Console.WriteLine(n + String.Join("", n.Reverse().ToList()));
        }
    }
}


using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;

namespace cf575
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_cf575B();
        }

        public static void solve_cf575B()
        {
            int q = Convert.ToInt32(Console.ReadLine());
            for (int tt = 0; tt < q; tt++)
            {
                int[] nk = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
                int n = nk[0];
                int k = nk[1];
                int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
                int cnt = 0;
                List<int> idxs = new List<int>();

                for (int i = 0; i < n; i++)
                {
                    if (a[i] % 2 != 0)
                    {
                        cnt++;
                        idxs.Add(i);
                    }
                }
                if (cnt >= k)
                {
                    int r = cnt % k;
                    if ((cnt % 2 == 0 && k % 2 == 0) || (cnt % 2 != 0 && k % 2 != 0))
                    {
                        Console.WriteLine("YES");
                        int j = 0;
                        while (j < k)
                        {
                            Console.Write("{0} ", j == k - 1 ? n : idxs[j] + 1);
                            j++;
                        }
                        Console.WriteLine();
                    }
                    else
                    {
                        Console.WriteLine("NO");
                    }

                }
                else
                {
                    Console.WriteLine("NO");
                }
            }
        }

        public static void solve_cf575A()
        {
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int q = sc.NextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < q; i++)
        {
            sb.AppendLine(Query(sc.NextInt(), sc.NextInt(), sc.IntArray()));

        }
        Console.Write(sb);
    }

    string Query(int n, int k, int[] a)
    {
        int odd = 0;
        foreach (var i in a)
        {
            if (i % 2 != 0) odd++;
        }

        if (odd < k) return "NO";
        if ((odd - k) % 2 != 0) return "NO";

        int d = odd - k;
        List<int> ans = new List<int>();
        for (int i = 0; i < n; i++)
        {
            if (a[i] % 2 != 0)
            {
                if (d == 0) ans.Add(i + 1);
                else d--;
            }
        }
        ans[ans.Count - 1] = n;
        return $"YES\n{string.Join(" ", ans) }";
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using CompLib.Util;

public class Program
{

    public void Solve()
    {
        var sc = new Scanner();
        int q = sc.NextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < q; i++)
        {
            sb.AppendLine(Query(sc.NextInt(), sc.NextInt(), sc.IntArray()));

        }
        Console.Write(sb);
    }

    string Query(int n, int k, int[] a)
    {
        int odd = 0;
        foreach (var i in a)
        {
            if (i % 2 != 0) odd++;
        }

        if (odd < k) return "NO";
        if ((odd - k) % 2 != 0) return "NO";

        int d = odd - k;
        List<int> ans = new List<int>();
        for (int i = 0; i < n; i++)
        {
            if (a[i] % 2 != 0)
            {
                if (d == 0) ans.Add(i + 1);
                else d--;
            }
        }
        return $"YES\n{string.Join(" ", ans) }";
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            while (_index >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            _line = Console.ReadLine().Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}


using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading;
using System.Diagnostics;

public class Solver
{
    public void Solve()
    {
        int queries = ReadInt();
        for (int query = 0; query < queries; query++)
        {
            int n = ReadInt();
            int k = ReadInt();
            int[] b = ReadIntArray();
            List<int> a = new List<int>();
            for (int i = 0; i < b.Length; i++)
            {
                if (b[i] % 2 == 1)
                    a.Add(i+1);
            }
            int m = a.Count;
            if (m < k || m % 2 != k % 2)
                Write("NO");
            else {
                Write("YES");
                Write(string.Join(" ", a.Take(k-1)), n);
            }
        }
    }

    #region Main

    protected static TextReader reader;
    protected static TextWriter writer;
    static void Main()
    {
        Debug.Listeners.Clear();
        Debug.Listeners.Add(new ConsoleTraceListener());
        Trace.Listeners.Clear();
        Trace.Listeners.Add(new ConsoleTraceListener());

        reader = new StreamReader(Console.OpenStandardInput());
        writer = new StreamWriter(Console.OpenStandardOutput());
        new Solver().Solve();
        reader.Close();
        writer.Close();
    }

    #endregion

    #region Read / Write
    private static Queue<string> currentLineTokens = new Queue<string>();
    private static string[] ReadAndSplitLine() { return reader.ReadLine().Split(new[] { ' ', '\t', }, StringSplitOptions.RemoveEmptyEntries); }
    public static string ReadToken() { while (currentLineTokens.Count == 0)currentLineTokens = new Queue<string>(ReadAndSplitLine()); return currentLineTokens.Dequeue(); }
    public static int ReadInt() { return int.Parse(ReadToken()); }
    public static long ReadLong() { return long.Parse(ReadToken()); }
    public static double ReadDouble() { return double.Parse(ReadToken(), CultureInfo.InvariantCulture); }
    public static int[] ReadIntArray() { return ReadAndSplitLine().Select(int.Parse).ToArray(); }
    public static long[] ReadLongArray() { return ReadAndSplitLine().Select(long.Parse).ToArray(); }
    public static double[] ReadDoubleArray() { return ReadAndSplitLine().Select(s => double.Parse(s, CultureInfo.InvariantCulture)).ToArray(); }
    public static int[][] ReadIntMatrix(int numberOfRows) { int[][] matrix = new int[numberOfRows][]; for (int i = 0; i < numberOfRows; i++)matrix[i] = ReadIntArray(); return matrix; }
    public static int[][] ReadAndTransposeIntMatrix(int numberOfRows)
    {
        int[][] matrix = ReadIntMatrix(numberOfRows); int[][] ret = new int[matrix[0].Length][];
        for (int i = 0; i < ret.Length; i++) { ret[i] = new int[numberOfRows]; for (int j = 0; j < numberOfRows; j++)ret[i][j] = matrix[j][i]; } return ret;
    }
    public static string[] ReadLines(int quantity) { string[] lines = new string[quantity]; for (int i = 0; i < quantity; i++)lines[i] = reader.ReadLine().Trim(); return lines; }
    public static void WriteArray<T>(IEnumerable<T> array) { writer.WriteLine(string.Join(" ", array)); }
    public static void Write(params object[] array) { WriteArray(array); }
    public static void WriteLines<T>(IEnumerable<T> array) { foreach (var a in array)writer.WriteLine(a); }
    private class SDictionary<TKey, TValue> : Dictionary<TKey, TValue>
    {
        public new TValue this[TKey key]
        {
            get { return ContainsKey(key) ? base[key] : default(TValue); }
            set { base[key] = value; }
        }
    }
    private static T[] Init<T>(int size) where T : new() { var ret = new T[size]; for (int i = 0; i < size; i++)ret[i] = new T(); return ret; }
    #endregion
}


using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using static System.Array;
using static System.Console;
using static System.Math;

namespace Olymp
{
  public class ProblemSolver
  {
    private readonly Tokenizer input;

    public void Solve()
    {
      var q = input.ReadInt();
      for (int i = 0; i < q; i++)
      {
        var (n, k) = input.Read2Int();
        var a = input.ReadIntArray(n);
        var oc = a.Count(x => x % 2 == 1);
        if(oc < k || oc % 2 != k % 2)
        {
          WriteLine("NO");
        }
        else
        {
          var ans = new List<int>();
          for (int j = 0; j < n && k > 1; j++)
          {
            if (a[j] % 2 == 1)
            {
              ans.Add(j + 1);
              k--;
            }
          }
          ans.Add(n);
          WriteLine("YES");
          WriteLine(string.Join(" ", ans));
        }
      }
    }

    public ProblemSolver(TextReader input)
    {
      this.input = new Tokenizer(input);
    }
  }

  #region Service classes

  public class Tokenizer
  {
    private readonly TextReader reader;

    public string ReadToEnd() => reader.ReadToEnd();

    public int ReadInt()
    {
      var c = SkipWs();
      if (c == -1)
        throw new EndOfStreamException();
      var isNegative = false;
      if (c == '-' || c == '+')
      {
        isNegative = c == '-';
        c = reader.Read();
        if (c == -1)
          throw new EndOfStreamException("Digit expected, but end of stream occurs");
      }

      if (!char.IsDigit((char)c))
        throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");

      checked
      {
        var result = (char)c - '0';
        c = reader.Read();
        while (c > 0 && !char.IsWhiteSpace((char)c))
        {
          if (!char.IsDigit((char)c))
            throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");
          result = result * 10 + (char)c - '0';
          c = reader.Read();
        }

        if (isNegative)
          result = -result;
        return result;
      }
    }

    public string ReadLine() => reader.ReadLine();

    public long ReadLong() => long.Parse(ReadToken());

    public double ReadDouble() => double.Parse(ReadToken(), CultureInfo.InvariantCulture);

    public int[] ReadIntArray(int n)
    {
      var a = new int[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadInt();
      return a;
    }

    public (int, int) Read2Int() => (ReadInt(), ReadInt());

    public (int, int, int) Read3Int() => (ReadInt(), ReadInt(), ReadInt());

    public (int, int, int, int) Read4Int() => (ReadInt(), ReadInt(), ReadInt(), ReadInt());

    public (long, long) Read2Long() => (ReadLong(), ReadLong());

    public long[] ReadLongArray(int n)
    {
      var a = new long[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadLong();
      return a;
    }

    public double[] ReadDoubleArray(int n)
    {
      var a = new double[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadDouble();
      return a;
    }

    public string ReadToken()
    {
      var c = SkipWs();
      if (c == -1)
        return null;
      var sb = new StringBuilder();
      while (c > 0 && !char.IsWhiteSpace((char)c))
      {
        sb.Append((char)c);
        c = reader.Read();
      }

      return sb.ToString();
    }

    private int SkipWs()
    {
      var c = reader.Read();
      if (c == -1)
        return c;
      while (c > 0 && char.IsWhiteSpace((char)c))
        c = reader.Read();
      return c;
    }

    public Tokenizer(TextReader reader)
    {
      this.reader = reader;
    }
  }

  internal class Program
  {
    public static void Main()
    {
      var solver = new ProblemSolver(In);
      solver.Solve();
    }
  }

  #endregion
}


using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using static System.Array;
using static System.Console;
using static System.Math;

namespace Olymp
{
  public class ProblemSolver
  {
    private readonly Tokenizer input;

    public void Solve()
    {
      var q = input.ReadInt();
      var output = new List<string>();
      for (int i = 0; i < q; i++)
      {
        var (n, k) = input.Read2Int();
        var a = input.ReadIntArray(n);
        var oc = a.Count(x => x % 2 == 1);
        if (oc < k || oc % 2 != k % 2)
        {
          output.Add("NO");
        }
        else
        {
          var ans = new List<int>();
          for (int j = 0; j < n && k > 1; j++)
          {
            if (a[j] % 2 == 1)
            {
              ans.Add(j + 1);
              k--;
            }
          }
          ans.Add(n);
          output.Add("YES");
          output.Add(string.Join(" ", ans));
        }
      }
      Write(string.Join(Environment.NewLine, output));
    }

    public ProblemSolver(TextReader input)
    {
      this.input = new Tokenizer(input);
    }
  }

  #region Service classes

  public class Tokenizer
  {
    private readonly TextReader reader;

    public string ReadToEnd() => reader.ReadToEnd();

    public int ReadInt()
    {
      var c = SkipWs();
      if (c == -1)
        throw new EndOfStreamException();
      var isNegative = false;
      if (c == '-' || c == '+')
      {
        isNegative = c == '-';
        c = reader.Read();
        if (c == -1)
          throw new EndOfStreamException("Digit expected, but end of stream occurs");
      }

      if (!char.IsDigit((char)c))
        throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");

      checked
      {
        var result = (char)c - '0';
        c = reader.Read();
        while (c > 0 && !char.IsWhiteSpace((char)c))
        {
          if (!char.IsDigit((char)c))
            throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");
          result = result * 10 + (char)c - '0';
          c = reader.Read();
        }

        if (isNegative)
          result = -result;
        return result;
      }
    }

    public string ReadLine() => reader.ReadLine();

    public long ReadLong() => long.Parse(ReadToken());

    public double ReadDouble() => double.Parse(ReadToken(), CultureInfo.InvariantCulture);

    public int[] ReadIntArray(int n)
    {
      var a = new int[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadInt();
      return a;
    }

    public (int, int) Read2Int() => (ReadInt(), ReadInt());

    public (int, int, int) Read3Int() => (ReadInt(), ReadInt(), ReadInt());

    public (int, int, int, int) Read4Int() => (ReadInt(), ReadInt(), ReadInt(), ReadInt());

    public (long, long) Read2Long() => (ReadLong(), ReadLong());

    public long[] ReadLongArray(int n)
    {
      var a = new long[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadLong();
      return a;
    }

    public double[] ReadDoubleArray(int n)
    {
      var a = new double[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadDouble();
      return a;
    }

    public string ReadToken()
    {
      var c = SkipWs();
      if (c == -1)
        return null;
      var sb = new StringBuilder();
      while (c > 0 && !char.IsWhiteSpace((char)c))
      {
        sb.Append((char)c);
        c = reader.Read();
      }

      return sb.ToString();
    }

    private int SkipWs()
    {
      var c = reader.Read();
      if (c == -1)
        return c;
      while (c > 0 && char.IsWhiteSpace((char)c))
        c = reader.Read();
      return c;
    }

    public Tokenizer(TextReader reader)
    {
      this.reader = reader;
    }
  }

  internal class Program
  {
    public static void Main()
    {
      var solver = new ProblemSolver(In);
      solver.Solve();
    }
  }

  #endregion
}


using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using static System.Array;
using static System.Console;
using static System.Math;

namespace Olymp
{
  public class ProblemSolver
  {
    private readonly Tokenizer input;

    public void Solve()
    {
      var q = input.ReadInt();
      var sb = new StringBuilder();
      for (int i = 0; i < q; i++)
      {
        var (n, k) = input.Read2Int();
        var a = input.ReadIntArray(n);
        var oc = a.Count(x => x % 2 == 1);
        if (oc < k || oc % 2 != k % 2)
        {
          sb.AppendLine("NO");
        }
        else
        {
          sb.AppendLine("YES");
          for (int j = 0; j < n && k > 1; j++)
          {
            if (a[j] % 2 == 1)
            {
              sb.Append(j + 1 + " ");
              k--;
            }
          }
          sb.Append(n);
          sb.AppendLine();
        }
      }
      Write(sb);
    }

    public ProblemSolver(TextReader input)
    {
      this.input = new Tokenizer(input);
    }
  }

  #region Service classes

  public class Tokenizer
  {
    private readonly TextReader reader;

    public string ReadToEnd() => reader.ReadToEnd();

    public int ReadInt()
    {
      var c = SkipWs();
      if (c == -1)
        throw new EndOfStreamException();
      var isNegative = false;
      if (c == '-' || c == '+')
      {
        isNegative = c == '-';
        c = reader.Read();
        if (c == -1)
          throw new EndOfStreamException("Digit expected, but end of stream occurs");
      }

      if (!char.IsDigit((char)c))
        throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");

      checked
      {
        var result = (char)c - '0';
        c = reader.Read();
        while (c > 0 && !char.IsWhiteSpace((char)c))
        {
          if (!char.IsDigit((char)c))
            throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");
          result = result * 10 + (char)c - '0';
          c = reader.Read();
        }

        if (isNegative)
          result = -result;
        return result;
      }
    }

    public string ReadLine() => reader.ReadLine();

    public long ReadLong() => long.Parse(ReadToken());

    public double ReadDouble() => double.Parse(ReadToken(), CultureInfo.InvariantCulture);

    public int[] ReadIntArray(int n)
    {
      var a = new int[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadInt();
      return a;
    }

    public (int, int) Read2Int() => (ReadInt(), ReadInt());

    public (int, int, int) Read3Int() => (ReadInt(), ReadInt(), ReadInt());

    public (int, int, int, int) Read4Int() => (ReadInt(), ReadInt(), ReadInt(), ReadInt());

    public (long, long) Read2Long() => (ReadLong(), ReadLong());

    public long[] ReadLongArray(int n)
    {
      var a = new long[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadLong();
      return a;
    }

    public double[] ReadDoubleArray(int n)
    {
      var a = new double[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadDouble();
      return a;
    }

    public string ReadToken()
    {
      var c = SkipWs();
      if (c == -1)
        return null;
      var sb = new StringBuilder();
      while (c > 0 && !char.IsWhiteSpace((char)c))
      {
        sb.Append((char)c);
        c = reader.Read();
      }

      return sb.ToString();
    }

    private int SkipWs()
    {
      var c = reader.Read();
      if (c == -1)
        return c;
      while (c > 0 && char.IsWhiteSpace((char)c))
        c = reader.Read();
      return c;
    }

    public Tokenizer(TextReader reader)
    {
      this.reader = reader;
    }
  }

  internal class Program
  {
    public static void Main()
    {
      var solver = new ProblemSolver(In);
      solver.Solve();
    }
  }

  #endregion
}


using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using static System.Array;
using static System.Console;
using static System.Math;

namespace Olymp
{
  public class ProblemSolver
  {
    private readonly Tokenizer input;

    private static readonly StreamWriter writer =
      new StreamWriter(OpenStandardOutput(1024 * 10), Encoding.ASCII, 1024 * 10);

    public void Solve()
    {
      var q = input.ReadInt();
      var sb = new StringBuilder();
      for (int i = 0; i < q; i++)
      {
        var (n, k) = input.Read2Int();
        var a = input.ReadIntArray(n);
        var oc = a.Count(x => x % 2 == 1);
        if (oc < k || oc % 2 != k % 2)
        {
          sb.AppendLine("NO");
        }
        else
        {
          sb.AppendLine("YES");
          for (int j = 0; j < n && k > 1; j++)
          {
            if (a[j] % 2 == 1)
            {
              sb.Append(j + 1 + " ");
              k--;
            }
          }
          sb.Append(n);
          sb.AppendLine();
        }
      }
      writer.Write(sb);
    }

    public ProblemSolver(TextReader input)
    {
      this.input = new Tokenizer(input);
    }
  }

  #region Service classes

  public class Tokenizer
  {
    private readonly TextReader reader;

    public string ReadToEnd() => reader.ReadToEnd();

    public int ReadInt()
    {
      var c = SkipWs();
      if (c == -1)
        throw new EndOfStreamException();
      var isNegative = false;
      if (c == '-' || c == '+')
      {
        isNegative = c == '-';
        c = reader.Read();
        if (c == -1)
          throw new EndOfStreamException("Digit expected, but end of stream occurs");
      }

      if (!char.IsDigit((char)c))
        throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");

      checked
      {
        var result = (char)c - '0';
        c = reader.Read();
        while (c > 0 && !char.IsWhiteSpace((char)c))
        {
          if (!char.IsDigit((char)c))
            throw new InvalidOperationException($"Digit expected, but was: '{(char)c}'");
          result = result * 10 + (char)c - '0';
          c = reader.Read();
        }

        if (isNegative)
          result = -result;
        return result;
      }
    }

    public string ReadLine() => reader.ReadLine();

    public long ReadLong() => long.Parse(ReadToken());

    public double ReadDouble() => double.Parse(ReadToken(), CultureInfo.InvariantCulture);

    public int[] ReadIntArray(int n)
    {
      var a = new int[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadInt();
      return a;
    }

    public (int, int) Read2Int() => (ReadInt(), ReadInt());

    public (int, int, int) Read3Int() => (ReadInt(), ReadInt(), ReadInt());

    public (int, int, int, int) Read4Int() => (ReadInt(), ReadInt(), ReadInt(), ReadInt());

    public (long, long) Read2Long() => (ReadLong(), ReadLong());

    public long[] ReadLongArray(int n)
    {
      var a = new long[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadLong();
      return a;
    }

    public double[] ReadDoubleArray(int n)
    {
      var a = new double[n];
      for (var i = 0; i < n; i++)
        a[i] = ReadDouble();
      return a;
    }

    public string ReadToken()
    {
      var c = SkipWs();
      if (c == -1)
        return null;
      var sb = new StringBuilder();
      while (c > 0 && !char.IsWhiteSpace((char)c))
      {
        sb.Append((char)c);
        c = reader.Read();
      }

      return sb.ToString();
    }

    private int SkipWs()
    {
      var c = reader.Read();
      if (c == -1)
        return c;
      while (c > 0 && char.IsWhiteSpace((char)c))
        c = reader.Read();
      return c;
    }

    public Tokenizer(TextReader reader)
    {
      this.reader = reader;
    }
  }

  internal class Program
  {
    public static void Main()
    {
      var solver = new ProblemSolver(In);
      solver.Solve();
    }
  }

  #endregion
}


 using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            int count = int.Parse(Console.ReadLine());

            for (int i = 0; i < count; ++i)
            {
                var n_k = Console.ReadLine().Split().ToArray();
                var n = int.Parse(n_k[0]);
                var k = int.Parse(n_k[1]);

                var data = Console.ReadLine().Split().Select(a=>int.Parse(a) % 2).ToArray();

                var list = new List<int>();

                for (int j = 0; j < n; ++j)
                {
                    if (data[j] == 1)
                    {
                        list.Add(j + 1);
                    }
                }

                if ((list.Count - k) >= 0 && (list.Count - k) % 2 == 0)
                {
                    Console.WriteLine("YES");
                    for (int q = 0; q < k - 1; ++q)
                    {
                        Console.Write(list[q] + " ");
                    }
                    Console.Write(n + "\n");
                }
                else
                {
                    Console.WriteLine("NO");
                }

            }
        }
    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             long n=long.Parse(Console.ReadLine());
             for(long i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  long m=long.Parse(y[0]);
                  long k=long.Parse(y[1]);
                  long o=0;
                  string[]y1=Console.ReadLine().Split(' ');
                  long[]a=new long[m];
                  for(long j=0;j<m;j++) a[j]=long.Parse(y1[j]);
                  if(k>1)
                  {
                  long nech=0;
                  for(long j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  int uu=0;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");

                       for(int j=0;j<m;j++)
                       {

                       if(a[j]%2!=0)
                       {
                       Console.Write("{0} ",j+1);
                       o++;
                       //uu=j+1;
                       }
                       if(o>=(k-1))
                       {

                            Console.Write("{0}",m);
                       break;
                       }
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");
                  }
                  else
                  {
                       if(a.Sum()%2==0)
                       Console.WriteLine("NO");
                       else
                       {
                       Console.WriteLine("YES");
                       Console.WriteLine(m);
                       }
                  }

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             int n=int.Parse(Console.ReadLine());
             for(int i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  int m=int.Parse(y[0]);
                  int k=int.Parse(y[1]);
                  int o=0;
                  string[]y1=Console.ReadLine().Split(' ');
                  int[]a=new int[m];
                  for(int j=0;j<m;j++) a[j]=int.Parse(y1[j]);
                  int nech=0;
                  for(int j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");

                       for(int j=0;j<m;j++)
                       {

                       if(a[j]%2!=0)
                       {
                       Console.Write("{0} ",j+1);
                       o++;
                       }
                       if(o==k)
                       break;
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             long n=long.Parse(Console.ReadLine());
             for(long i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  long m=long.Parse(y[0]);
                  long k=long.Parse(y[1]);
                  long o=0;
                  string[]y1=Console.ReadLine().Split(' ');
                  long[]a=new long[m];
                  for(long j=0;j<m;j++) a[j]=long.Parse(y1[j]);
                  long nech=0;
                  for(long j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  int uu=0;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");

                       for(int j=0;j<m;j++)
                       {

                       if(a[j]%2!=0)
                       {
                       Console.Write("{0} ",j+1);
                       o++;
                       uu=j+1;
                       }
                       if(o==k-1)
                       {

                            Console.Write("{0}",m);
                       break;
                       }
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             long n=long.Parse(Console.ReadLine());
             for(long i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  long m=long.Parse(y[0]);
                  long k=long.Parse(y[1]);
                  long o=0;
                  string[]y1=Console.ReadLine().Split(' ');
                  long[]a=new long[m];
                  for(long j=0;j<m;j++) a[j]=long.Parse(y1[j]);
                  long nech=0;
                  for(long j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  int uu=0;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");

                       for(int j=0;j<m;j++)
                       {

                       if(a[j]%2!=0)
                       {
                       Console.Write("{0} ",j+1);
                       o++;
                       uu=j;
                       }
                       if(o==k)
                       {
                            if(uu<n)
                            Console.Write("{0}",m);
                       break;
                       }
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             int n=int.Parse(Console.ReadLine());
             for(int i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  int m=int.Parse(y[0]);
                  int k=int.Parse(y[1]);
                  string[]y1=Console.ReadLine().Split(' ');
                  int[]a=new int[m];
                  for(int j=0;j<m;j++) a[j]=int.Parse(y1[j]);
                  int nech=0;
                  for(int j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");
                       int o=0;
                       for(int j=0;j<m;j++)
                       {

                            if(o>k)
                            break;
                       if(a[j]%2!=0)
                       Console.Write("{0} ",j+1);
o++;
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             long n=long.Parse(Console.ReadLine());
             for(long i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  long m=long.Parse(y[0]);
                  long k=long.Parse(y[1]);
                  long o=0;
                  string[]y1=Console.ReadLine().Split(' ');
                  long[]a=new long[m];
                  for(long j=0;j<m;j++) a[j]=long.Parse(y1[j]);
                  long nech=0;
                  for(long j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");

                       for(int j=0;j<m;j++)
                       {

                       if(a[j]%2!=0)
                       {
                       Console.Write("{0} ",j+1);
                       o++;
                       }
                       if(o==k)
                       break;
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             int n=int.Parse(Console.ReadLine());
             for(int i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  int m=int.Parse(y[0]);
                  int k=int.Parse(y[1]);
                  string[]y1=Console.ReadLine().Split(' ');
                  int[]a=new int[m];
                  for(int j=0;j<m;j++) a[j]=int.Parse(y1[j]);
                  int nech=0;
                  for(int j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");
                       int o=0;
                       for(int j=0;j<m;j++)
                       {
                            o++;
                            if(o>k)
                            break;
                       if(a[j]%2!=0)
                       Console.Write("{0} ",j+1);

                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             int n=int.Parse(Console.ReadLine());
             for(int i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  int m=int.Parse(y[0]);
                  int k=int.Parse(y[1]);
                  string[]y1=Console.ReadLine().Split(' ');
                  int[]a=new int[m];
                  for(int j=0;j<m;j++) a[j]=int.Parse(y1[j]);
                  int nech=0;
                  for(int j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");
                       for(int j=0;j<m;j++)
                       if(a[j]%2!=0)
                       Console.Write("{0} ",j+1);
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

             long n=long.Parse(Console.ReadLine());
             for(long i=0;i<n;i++)
             {
                  string[]y=Console.ReadLine().Split(' ');
                  long m=long.Parse(y[0]);
                  long k=long.Parse(y[1]);
                  long o=0;
                  string[]y1=Console.ReadLine().Split(' ');
                  long[]a=new long[m];
                  for(long j=0;j<m;j++) a[j]=long.Parse(y1[j]);
                  long nech=0;
                  for(long j=0;j<m;j++)
                  if(a[j]%2!=0)
                  nech++;
                  if(nech>=k&&(nech-k)%2==0)
                  {
                       Console.WriteLine("YES");

                       for(int j=0;j<m;j++)
                       {

                       if(a[j]%2!=0)
                       {
                       Console.Write("{0} ",j+1);
                       o++;
                       }
                       if(o==k-1)
                       break;
                       }
                       Console.WriteLine();
                  }
                  else
                  Console.WriteLine("NO");

             }
        }

    }
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var Q = sc.Int;
        while (Q-- > 0)
        {
            int N, K;
            sc.Make(out N, out K);
            var A = sc.ArrInt;
            var all = 0;
            for (int i = 0; i < A.Length; i++)
            {
                A[i] &= 1;
                if(A[i]==1)
                all++;
            }
            if (all % 2 != K % 2||all<K) { WriteLine("NO");continue; }
            var res = new List<int>();
            for(int j = 0; j < N-1; j++)
            {
                if (A[j] == 1) res.Add(j + 1);
                if (res.Count == K-1) break;
            }
            res.Add(N);
            WriteLine("YES");
            Console.WriteLine(string.Join(" ", res));
        }
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Shuffle<T>(this IList<T> A) { T[] rt = A.ToArray(); Random rnd = new Random(); for (int i = rt.Length - 1; i >= 1; i--) swap(ref rt[i], ref rt[rnd.Next(i + 1)]); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }

}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion


using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var Q = sc.Int;
        while (Q-- > 0)
        {
            int N, K;
            sc.Make(out N, out K);
            var A = sc.ArrInt;
            var all = 0;
            for (int i = 0; i < A.Length; i++)
            {
                A[i] &= 1;
                if(A[i]==1)
                all++;
            }
            if (all % 2 != K % 2||all<K) { WriteLine("NO");continue; }
            if (K == 1) { WriteLine($"YES\n{N}");continue; }
            var res = new List<int>();
            for(int j = 0; j < N-1; j++)
            {
                if (A[j] == 1) res.Add(j + 1);
                if (res.Count == K-1) break;
            }
            res.Add(N);
            WriteLine("YES");
            Console.WriteLine(string.Join(" ", res));
        }
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Shuffle<T>(this IList<T> A) { T[] rt = A.ToArray(); Random rnd = new Random(); for (int i = rt.Length - 1; i >= 1; i--) swap(ref rt[i], ref rt[rnd.Next(i + 1)]); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }

}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion


using System;

class _1196B
{
	static void Main()
	{
		int q = int.Parse(Console.ReadLine());
		string[] anss = new string[q];
		for (int i = 0; i < q; ++i)
		{
			int[] nk = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
			int n = nk[0];
			int k = nk[1];
			int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);

			int cnt = 0;
			for (int j = 0; j < n; ++j)
			{
				cnt += a[j] & 1;
			}
			if (((cnt + k) & 1) == 1 || cnt < k)
			{
				anss[i] = "NO";
				continue;
			}
			int[] borders = new int[k];
			borders[k - 1] = n;
			int pos = -1;
			for (int j = 0; j < n; ++j)
			{
				if (pos == k - 1)
				{
					break;
				}
				if ((a[j] & 1) == 1)
				{
					borders[++pos] = j + 1;
				}
			}
			anss[i] = "YES\r\n" + string.Join(" ", borders);
		}

		Console.WriteLine(string.Join("\r\n", anss));
	}
}


using System;

class _1196B
{
	static void Main()
	{
		int q = int.Parse(Console.ReadLine());
		string[] anss = new string[q];
		for (int i = 0; i < q; ++i)
		{
			int[] nk = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
			int n = nk[0];
			int k = nk[1];
			int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);

			int cnt = 0;
			for (int j = 0; j < n; ++j)
			{
				cnt += a[j] & 1;
			}
			if (((cnt + k) & 1) == 1 || cnt < k)
			{
				anss[i] = "NO";
				continue;
			}
			if (k == 1)
			{
				anss[i] = "YES\r\n" + n;
				continue;
			}
			int[] borders = new int[k];
			borders[k - 1] = n;
			int pos = -1;
			for (int j = 0; j < n; ++j)
			{
				if (pos == k - 1)
				{
					break;
				}
				if ((a[j] & 1) == 1)
				{
					borders[++pos] = j + 1;
				}
			}
			anss[i] = "YES\r\n" + string.Join(" ", borders);
		}

		Console.WriteLine(string.Join("\r\n", anss));
	}
}


using System;

class _1196B
{
	static void Main()
	{
		int q = int.Parse(Console.ReadLine());
		string[] anss = new string[q];
		for (int i = 0; i < q; ++i)
		{
			int[] nk = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
			int n = nk[0];
			int k = nk[1];
			int[] a = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);

			int cnt = 0;
			for (int j = 0; j < n; ++j)
			{
				cnt += a[j] & 1;
			}
			if (((cnt + k) & 1) == 1 || cnt < k)
			{
				anss[i] = "NO";
				continue;
			}
			int[] borders = new int[k];
			borders[k - 1] = n;
			int pos = -1;
			for (int j = 0; j < n; ++j)
			{
				if (pos == k - 2)
				{
					break;
				}
				if ((a[j] & 1) == 1)
				{
					borders[++pos] = j + 1;
				}
			}
			anss[i] = "YES\r\n" + string.Join(" ", borders);
		}

		Console.WriteLine(string.Join("\r\n", anss));
	}
}


using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace NecetnijeSummi
{
    class Program
    {
        static void Main(string[] args)
        {
            var q = int.Parse(Console.ReadLine());

            for (var i = 1; i <= q; i++)
            {
                string[] s = Console.ReadLine().Split();
                var n = int.Parse(s[0]);
                var k = int.Parse(s[1]);

                int[] a = Console.ReadLine().Split().Select(x => int.Parse(x)).ToArray();

                var oddCount = a.Count(x => x % 2 == 1);
                if (oddCount<k || (oddCount - k) % 2 == 1)
                {
                    Console.WriteLine("NO");
                }
                else
                {
                    Console.WriteLine("YES");
                    var positions = new List<int>();

                    var count = 0;
                    for (var j = 0; j < n && count<k-1; j++)
                    {
                        if (a[j] % 2 == 1)
                        {
                            positions.Add(j + 1);
                            count++;
                        }

                    }

                    positions.Add(n);
                    Console.WriteLine(string.Join(" ", positions));
                }
            }

        }
    }
}


using System;
using System.Collections.Generic;
using System.IO;
using System.Text;

namespace Odd_Sum_Segments
{
    internal class Program
    {
        private static readonly StreamReader reader = new StreamReader(Console.OpenStandardInput(1024*10), Encoding.ASCII, false, 1024*10);
        private static readonly StreamWriter writer = new StreamWriter(Console.OpenStandardOutput(1024*10), Encoding.ASCII, 1024*10);

        private static void Main(string[] args)
        {
            for (int i = Next() - 1; i >= 0; i--)
            {
                Solve();
            }
            writer.Flush();
        }

        private static void Solve()
        {
            int n = Next();
            int k = Next();

            var nn = new int[n];
            for (int i = 0; i < n; i++)
            {
                nn[i] = Next();
            }

            long sum = 0;
            var ans = new List<int>();
            for (int i = 0; i < n; i++)
            {
                sum += nn[i];
                if (sum%2 == 1)
                {
                    ans.Add(i);
                    sum = 0;
                }
            }
            if (ans.Count < k || ans[ans.Count - 1] != n - 1 || (ans.Count - k)%2 == 1)
            {
                writer.WriteLine("NO");
                return;
            }
            writer.WriteLine("YES");
            for (int i = 0; i < k - 1; i++)
            {
                writer.Write(ans[i] + 1);
                writer.Write(' ');
            }
            writer.WriteLine(n);
        }

        private static int Next()
        {
            int c;
            int res = 0;
            do
            {
                c = reader.Read();
                if (c == -1)
                    return res;
            } while (c < '0' || c > '9');
            res = c - '0';
            while (true)
            {
                c = reader.Read();
                if (c < '0' || c > '9')
                    return res;
                res *= 10;
                res += c - '0';
            }
        }
    }
}


using System;
using System.Collections.Generic;
using System.IO;
using System.Text;

namespace Odd_Sum_Segments
{
    internal class Program
    {
        private static readonly StreamReader reader = new StreamReader(Console.OpenStandardInput(1024*10), Encoding.ASCII, false, 1024*10);
        private static readonly StreamWriter writer = new StreamWriter(Console.OpenStandardOutput(1024*10), Encoding.ASCII, 1024*10);

        private static void Main(string[] args)
        {
            for (int i = Next() - 1; i >= 0; i--)
            {
                Solve();
            }
            writer.Flush();
        }

        private static void Solve()
        {
            int n = Next();
            int k = Next();

            var nn = new int[n];
            for (int i = 0; i < n; i++)
            {
                nn[i] = Next();
            }

            long sum = 0;
            var ans = new List<int>();
            for (int i = 0; i < n; i++)
            {
                sum += nn[i];
                if (sum%2 == 1)
                {
                    ans.Add(i);
                    sum = 0;

                    if (ans.Count == k)
                    {
                        for (; i < n; i++)
                        {
                            sum += nn[i];
                        }
                        if (sum%2 != 1)
                        {
                            writer.WriteLine("NO");
                            return;
                        }
                        break;
                    }
                }
            }
            if (ans.Count < k)
            {
                writer.WriteLine("NO");
                return;
            }
            writer.WriteLine("YES");
            for (int i = 0; i < k - 1; i++)
            {
                writer.Write(ans[i] + 1);
                writer.Write(' ');
            }
            writer.WriteLine(n);
        }

        private static int Next()
        {
            int c;
            int res = 0;
            do
            {
                c = reader.Read();
                if (c == -1)
                    return res;
            } while (c < '0' || c > '9');
            res = c - '0';
            while (true)
            {
                c = reader.Read();
                if (c < '0' || c > '9')
                    return res;
                res *= 10;
                res += c - '0';
            }
        }
    }
}


using System;
using System.Collections.Generic;
using System.IO;
using System.Text;

namespace Odd_Sum_Segments
{
    internal class Program
    {
        private static readonly StreamReader reader = new StreamReader(Console.OpenStandardInput(1024*10), Encoding.ASCII, false, 1024*10);
        private static readonly StreamWriter writer = new StreamWriter(Console.OpenStandardOutput(1024*10), Encoding.ASCII, 1024*10);

        private static void Main(string[] args)
        {
            for (int i = Next() - 1; i >= 0; i--)
            {
                Solve();
            }
            writer.Flush();
        }

        private static void Solve()
        {
            int n = Next();
            int k = Next();

            var nn = new int[n];
            for (int i = 0; i < n; i++)
            {
                nn[i] = Next();
            }

            long sum = 0;
            var ans = new List<int>();
            for (int i = 0; i < n; i++)
            {
                sum += nn[i];
                if (sum%2 == 1)
                {
                    ans.Add(i);
                    sum = 0;

                    if (ans.Count == k)
                    {
                        for (; i < n; i++)
                        {
                            sum += nn[i];
                        }
                        if (sum%2 != 0)
                        {
                            writer.WriteLine("NO");
                            return;
                        }
                        break;
                    }
                }
            }
            if (ans.Count < k)
            {
                writer.WriteLine("NO");
                return;
            }
            writer.WriteLine("YES");
            for (int i = 0; i < k - 1; i++)
            {
                writer.Write(ans[i] + 1);
                writer.Write(' ');
            }
            writer.WriteLine(n);
        }

        private static int Next()
        {
            int c;
            int res = 0;
            do
            {
                c = reader.Read();
                if (c == -1)
                    return res;
            } while (c < '0' || c > '9');
            res = c - '0';
            while (true)
            {
                c = reader.Read();
                if (c < '0' || c > '9')
                    return res;
                res *= 10;
                res += c - '0';
            }
        }
    }
}


using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		for(;Q>0;Q--){
			var d = ria();
			N = d[0]; K = d[1];
			A = rla();
			List<int> L = new List<int>();
			for(int i=0;i<N;i++) if(A[i] % 2 == 1) L.Add(i + 1);
//Console.WriteLine("ok");
			if(L.Count < K){
				Console.WriteLine("NO");
			} else {
				while(L.Count >= K) L.RemoveAt(L.Count - 1);
				L.Add(N);
				Console.WriteLine("YES");
				Console.WriteLine(String.Join(" ",L));
			}

		}
	}
	int N,K;
	long[] A;
	int Q;
	public Sol(){
		Q = ri();
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}


using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		for(;Q>0;Q--){
			var d = ria();
			N = d[0]; K = d[1];
			A = rla();
			List<int> L = new List<int>();
			for(int i=0;i<N;i++) if(A[i] % 2 == 1) L.Add(i + 1);
//Console.WriteLine("ok");
			if(L.Count < K){
				Console.WriteLine("NO");
			} else if(L.Count % 2 != K % 2){
				Console.WriteLine("NO");
			}else {

				while(L.Count >= K) L.RemoveAt(L.Count - 1);
				L.Add(N);
				Console.WriteLine("YES");
				Console.WriteLine(String.Join(" ",L));
			}

		}
	}
	int N,K;
	long[] A;
	int Q;
	public Sol(){
		Q = ri();
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}


//#define EXTENDSTACKSIZE

using System;
 using System.Collections.Generic;
 using System.Globalization;
using System.IO;
using System.Linq;
 using System.Text;
 using System.Threading;

         namespace CF
{
    internal class Program
    {
        private const int stackSize = 64 * 1024 * 1024;

        private static void Run()
        {
            using (var sr = new InputReader(Console.In))
//            using (var sr = new InputReader(new StreamReader("input.txt")))
            using (var sw = Console.Out)
//            using (var sw = new StreamWriter("output.txt"))
            using (var task = new Task(sr, sw)) {
                task.Solve();
//                Console.ReadKey();
            }
        }

        private static void Main(string[] args)
        {
#if EXTENDSTACKSIZE
            var threadStart = new ThreadStart(Run);
            var thread = new Thread(threadStart, stackSize);
            thread.Start();
            thread.Join();
#else
            Run();
#endif
        }
    }

    internal class Task : IDisposable
    {
        private readonly InputReader sr;
        private readonly TextWriter sw;
        private bool isDispose;

        public Task(InputReader sr, TextWriter sw)
        {
            this.sr = sr;
            this.sw = sw;
        }

        public void Solve()
        {
            var tests = sr.NextInt32();
            var answ = new StringBuilder();
            for (var t = 0; t < tests; t++)
            {
                var n = sr.NextInt32();
                var k = sr.NextInt32();
                var items = sr.ReadArrayOfInt64();
                var odd = items.Count(i => i % 2 == 1);
                if (odd < k)
                {
                    answ.AppendLine("NO");
                    continue;
                }

                if (k == 1 && odd % 2 == 0)
                {
                    answ.AppendLine("NO");
                    continue;
                }

                answ.AppendLine("YES");
                for (var i = 0; i < n; i++)
                {
                    if (items[i] % 2 == 1)
                    {
                        if (k == 1)
                        {
                            answ.Append(n.ToString());
                            break;
                        }
                        var j = i + 1;
                        for (; j < n; j++)
                        {
                            if (items[j] % 2 == 1)
                            {
                                break;
                            }
                        }

                        i = j - 1;
                        answ.Append((i + 1) + " ");
                        k--;
                    }
                }

                answ.AppendLine();
            }

            sw.Write(answ);
        }

        public void Dispose()
        {
            Dispose(true);
            GC.SuppressFinalize(this);
        }

        private void Dispose(bool disposing)
        {
            if (!isDispose) {
                if (disposing) {
                    if(sr != null)
                        sr.Dispose();

                    if(sw != null)
                        sw.Dispose();
                }

                isDispose = true;
            }
        }
    }
}

internal class InputReader : IDisposable
{
    private bool isDispose;
    private readonly TextReader sr;
    private string[] buffer;
    private int seek;

    public InputReader(TextReader stream)
    {
        sr = stream;
    }

    public void Dispose()
    {
        Dispose(true);
        GC.SuppressFinalize(this);
    }

    public string NextString()
    {
        var result = sr.ReadLine();
        return result;
    }

    public int NextInt32()
    {
        return Int32.Parse(ReadNextToken());
    }

    private string ReadNextToken()
    {
        if (buffer == null || seek == buffer.Length) {
            seek = 0;
            buffer = NextSplitStrings();
        }

        return buffer[seek++];
    }

    public long NextInt64()
    {
        return Int64.Parse(ReadNextToken());
    }

    public int[] ReadArrayOfInt32()
    {
        return ReadArray(Int32.Parse);
    }

    public long[] ReadArrayOfInt64()
    {
        return ReadArray(Int64.Parse);
    }

    public string[] NextSplitStrings()
    {
        return NextString()
            .Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
    }

    public T[] ReadArray<T>(Func<string, CultureInfo, T> func)
    {
        return NextSplitStrings()
            .Select(s => func(s, CultureInfo.InvariantCulture))
            .ToArray();
    }

    public T[] ReadArrayFromString<T>(Func<string, CultureInfo, T> func, string str)
    {
        return
            str.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries)
                .Select(s => func(s, CultureInfo.InvariantCulture))
                .ToArray();
    }

    protected void Dispose(bool dispose)
    {
        if (!isDispose)
        {
            if (dispose)
                sr.Close();

            isDispose = true;
        }
    }

    ~InputReader()
    {
        Dispose(false);
    }
}