Codeforces 306B

 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cstdlib>
 #include <ctime>
 #include <cmath>
 #include <set>
 #include <map>
 using namespace std;

 const int maxm=int(2e5)+;

 struct data
 {
     int x, y, num;
     bool operator < (const data b) const
     {
         if (x!=b.x) return x<b.x;
         return y>b.y;
     }
 };

 int n, m;
 int ans;
 data a[maxm];
 bool vis[maxm];

 void init()
 {
     scanf("%d%d", &n, &m);
     for (int i=; i<=m; ++i)
     {
         scanf("%d%d", &a[i].x, &a[i].y);
         a[i].y+=a[i].x-;
         a[i].num=i;
     }
     sort(a+, a++m);
 }
 void solve()
 {
     ans=m;
     for (int i=, next; i<=m; i=next)
     {
         vis[a[i].num]=true;
         ans--;
         next=i;
         int k=i+;
         while (k<=m && a[k].x<=a[i].y+)
         {
             if (a[k].y>a[next].y) next=k;
             ++k;
         }
         if (next==i) next=k;
     }
     printf("%d\n", ans);
     for (int i=; i<=m; ++i)
         if (!vis[i]) printf("%d ", i);
 }
 int main()
 {
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     init();
     solve();
     return ;
 }