#include <iostream>

#include <vector>

#include <algorithm>

int main() {

     std::ios_base::sync_with_stdio(false);

     std::cin.tie(NULL); int n, k;

     std::cin >> n >> k;

     std::vector<long long> a(n);

     for (int i = 0; i < n; ++i) {

            std::cin >> a[i];

}

if (n == 0)

{

    std::cout << "0 0\n\n";

    return 0;

}

if (n == 1)

{

     std::cout << "1 " << a[0] << "\n";

     std::cout << "1\n"; return 0;

}

    std::vector<long long> dp(n);

   dp[0] = a[0];

   dp[1] = std::max(a[0], a[1]);

    for (int i = 2; i < n; ++i)

{

    dp[i] = std::max(dp[i-1], a[i] + dp[i-2]);

}

    long long max_total_wine = dp[n-1];

    std::vector<int> selected_bottles;

   int current_idx = n - 1;

  while (current_idx >= 0) {

         if (current_idx == 0) {

                 if (dp[0] == a[0] && (n == 1 || dp[1] != a[0])) {

                     selected_bottles.push_back(1); } break; } if (dp[current_idx] == dp[current_idx - 1])

{

 int current_idx--;

}

else {

  selected_bottles.push_back(current_idx + 1);

  current_idx -= 2; } }

  std::reverse(selected_bottles.begin(), selected_bottles.end()); 

  std: :cout << selected_bottles.size() << " " << max_total_wine << "\n";

for (int i = 0; i < selected_bottles.size(); ++i)

{

std: :cout << selected_bottles[i] << (i == selected_bottles.size() - 1 ? "" : " ");

}

std::cout << "\n";

return 0;

}