#include <iostream>
#include <queue>
#define ll long long

using namespace std;

int main()
{
    ll n, k, v, h, m1 = 0, m2 = 0;
    cin >> n >> h;
    vector < pair <ll, ll> > a;
    deque <ll> p1, p2;
    for (ll i = 1; i <= n; ++i)
    {
        cin >> k >> v;
        a.push_back({ k, v });
    }

    ll i, akt1 = 0, akt2 = 0;
    for (ll t = 1; t <= h; ++t)
    {
        i = 1;
        for (auto& e : a)
        {
            if (t == e.second)
            {
                if (akt1 < e.first)
                {
                    akt1 = e.second;
                    ++m1;
                    p1.push_front(i);
                    break;
                }
                if (akt2 < e.first)
                {
                    akt2 = e.second;
                    ++m2;
                    p2.push_front(i);
                    break;
                }
            }
            ++i;
        }
    }
    cout << m1 << " " << m2 << endl;
    for (ll j = p1.size() - 1; j >= 0; --j)
        cout << p1[j] << " ";
    cout << endl;

    for (ll j = p2.size() - 1; j >= 0; --j)
        cout << p2[j] << " ";

    return 0;
}