#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define endl "\n"
#define pll pair<ll, ll>
#define fs first
#define sc second
#define vll vector<ll>
#define v2d vector<vector<ll>>
#define vpll vector<pll>
#define qll queue<ll>
#define stll stack<ll>
#define sll set<ll>
#define mll map<ll, ll>

struct st
{
    ll k;
    ll v;
    ll i;
};

bool sorting(st a, st b)
{
    return (a.v < b.v);
}

ll n, m;
vector<st> v;

void solve()
{
    cin >> n >> m;
    v.resize(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> v[i].k >> v[i].v;
        v[i].i = i;
    }
    sort(v.begin(), v.end(), sorting);
    vll m1, m2;
    for (ll i = 0; i < n; i++)
    {
        if (m1.size() == 0) m1.push_back(i);
        else if (v[i].k > v[m1[m1.size()-1]].v)
        {
            if (m2.size() > 0 && v[i].k > v[m2[m2.size()-1]].v && v[m2[m2.size()-1]].v > v[m1[m1.size()-1]].v) m2.push_back(i);
            else m1.push_back(i);
        }
        else if (m2.size() == 0) m2.push_back(i);
        else if (v[i].k > v[m2[m2.size()-1]].v) m2.push_back(i);
    }
    cout << m1.size() << " " << m2.size() << endl;
    for (ll i : m1) cout << v[i].i+1 << " ";
    cout << endl;
    for (ll i : m2) cout << v[i].i+1 << " ";
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}