#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>

int main() {
   int n, m;
   std::cin >> n >> m;
   std::vector<std::pair<int, int>> nap(n, {-1, -1});
   std::vector<std::pair<int, bool>> d(n, {-1, 0});
   for(int i = 0; i < m; i++) {
      int a, h;
      std::cin >> a >> h;
      a--;
      if(h > nap[a].first) {
         nap[a].first = h;
         nap[a].second = i;
      }
   }
   d[0] = {nap[0].first, 1};
   if(d[1].first > d[0].first) {
      d[1] = {nap[1].first, 1};
      d[0] = {d[0].first, 0};
   }
   else
      d[1] = {d[0].first, 0};


   for(int i = 2; i < n; i++) {
      int cur = d[i - 2].first + nap[i].first;
      if(cur > d[i - 1].first) {
         d[i] = {cur, 1};
         d[i - 1].second = 0;
      } else {
         d[i] = {d[i - 1].first, 0};
      }
   }

   int cnt = 0;
   for(int i = 0; i < n; i++)
      cnt += d[i].second;
   std::cout << d[n - 1].first << ' ' << cnt << '\n';
   for(int i = 0; i < n; i++) {
      if(d[i].second) {
         std::cout << nap[i].second + 1 << ' ';
      }
   }
}