// https://njudge.hu/problemset/main/NT25_munkak - Szücs Patrik - Kevin
#include <iostream>
#include <vector>

int main()
{
    int n, m;
    std::cin >> n >> m;

    std::vector<int> best(n), dp(n), id(n);
    for (int i = 0; i < m; i++)
    {
        int d, p;
        std::cin >> d >> p;

        if (p > best[--d])
        {
            best[d] = p;
            id[d] = i + 1;
        }
    }

    dp[0] = best[0];
    dp[1] = std::max(best[0], best[1]);
    for (int i = 2; i < n; i++)
        dp[i] = std::max(dp[i - 2] + best[i], dp[i - 1]);

    std::cout << dp[n - 1] << ' ';

    // rekonstrukcio
    std::vector<int> selected;
    int i = n - 1;
    while (i >= 0)
    {
        if (i == 0)
        {
            if (dp[i] > 0)
                selected.push_back(id[i]);
            break;
        }

        if (dp[i] == dp[i - 1])
            i--;
        else if (dp[i] == dp[i - 2] + best[i])
        {
            selected.push_back(id[i]);
            i -= 2;
        }
    }

    std::cout << selected.size() << '\n';
    for (int a : selected)
    {
        std::cout << a << ' ';
    }

    return 0;
}