1 #include "bits/stdc++.h"
  2 #define Never return
  3 #define Explode 0
  4
  5 using namespace std ;
  6 struct SegTree { int l , r , Add , Cnt , Del ;};
  7 const int maxN = 2e5 + 100 ;
  8
  9 SegTree tr[ maxN << 2 ] ;
 10 int arr[ maxN ] ;
 11 bool op[ maxN ] ;
 12
 13 int INPUT ( ) {
 14         int x = 0 , f = 1 ;char ch = getchar( ) ;
 15         while ( ch < '0' || ch > '9' ) { if( ch == '-' ) f= -1 ; ch = getchar( ) ; }
 16         while ( ch >= '0' && ch <= '9' ) { x = ( x << 1 ) + ( x << 3) + ch - '0' ; ch = getchar( ) ; }
 17         return x * f ;
 18 }
 19
 20 int Query_Tree ( const int i , const int Target ) {
 21         if ( Target == tr[ i << 1 | 1 ].Add ) {
 22                 return tr[ i ].Cnt - tr[ i << 1 | 1 ].Cnt ;
 23         }
 24         else if ( Target < tr[ i << 1 | 1 ].Add ) {
 25                 return tr[ i ].Cnt - tr[ i << 1 | 1 ].Cnt + Query_Tree ( i << 1 | 1 , Target ) ;
 26         }
 27         else {
 28                 return Query_Tree ( i << 1 , Target - tr[ i << 1 | 1 ].Add + tr[ i << 1 | 1 ].Del ) ;
 29         }
 30 }
 31
 32 void Push_up ( const int i ) {
 33         int lchild = i << 1 ;
 34         int rchild = lchild + 1 ;
 35         if ( tr[ rchild ].Del >= tr[ lchild ].Add ) {//右区间 删除数大于等于左边层数
 36                 tr[ i ].Del = tr[ lchild ].Del + tr[ rchild ].Del - tr[ lchild ].Add ;
 37                 tr[ i ].Add = tr[ rchild ].Add ;
 38                 tr[ i ].Cnt = tr[ rchild ].Cnt ;
 39         }
 40         else if ( !tr[ rchild ].Del ) {//右区间没有删除
 41                 tr[ i ].Add = tr[ lchild ].Add + tr[ rchild ].Add ;
 42                 tr[ i ].Cnt = tr[ lchild ].Cnt + tr[ rchild ].Cnt ;
 43                 tr[ i ].Del = tr[ lchild ].Del ;
 44         }
 45         else {//右边无法全部删去左边
 46                 tr[ i ].Del = tr[ lchild ].Del ;
 47                 tr[ i ].Add = tr[ lchild ].Add + tr[ rchild ].Add - tr[ rchild ].Del ;
 48                 tr[ i ].Cnt = tr[ rchild ].Cnt + Query_Tree ( lchild , tr[ rchild ].Del ) ;
 49         }
 50 }
 51 void Build_Tree ( const int x , const int y , const int i ) {
 52         tr[ i ].l = x ;
 53         tr[ i ].r = y ;
 54         if ( x == y ) {
 55                 if ( op[ x ] ) tr[ i ].Del = arr[ x ] ;
 56                 else if ( !op[ x ] ) {
 57                         tr[ i ].Add = 1 ;
 58                         tr[ i ].Cnt = arr[ x ] ;
 59                 }
 60         }
 61         else {
 62                 int mid = ( tr[ i ].l + tr[ i ].r ) >> 1 ;
 63                 Build_Tree ( x , mid , i<<1 ) ;
 64                 Build_Tree ( mid + 1 , y , i<<1|1 ) ;
 65                 Push_up ( i ) ;
 66         }
 67         return ;
 68 }
 69
 70 void Update_Tree ( const int i , const int Target ) {
 71         if ( tr[ i ].l == tr[ i ].r ) {
 72                 tr[ i ].Add = tr[ i ].Cnt = tr[ i ].Del = 0 ;
 73                 if ( INPUT ( ) ) {
 74                         tr[ i ].Del = INPUT( ) ;
 75                 }
 76                 else {
 77                         tr[ i ].Cnt = INPUT ( ) ;
 78                         tr[ i ].Add = 1 ;
 79                 }
 80         }
 81         else {
 82                 int mid = ( tr[ i ].l + tr[ i ].r ) >> 1 ;
 83                 if ( Target > mid ) Update_Tree ( i << 1 | 1 , Target ) ;
 84                 else if( Target <= mid ) Update_Tree ( i << 1 , Target ) ;
 85                 Push_up ( i ) ;
 86         }
 87         return ;
 88 }
 89
 90 int main ( ) {
 91         int N , Q ;
 92         freopen("weed.in", "r", stdin);
 93         freopen("weed.out", "w", stdout);
 94         scanf ( "%d%d" , &N , &Q ) ;
 95         for ( int i=1 ; i<=N ; ++i ) scanf ("%d%d" , op + i , arr + i ) ;
 96         Build_Tree ( 1 , N , 1 ) ;
 97         while ( Q-- ) {
 98                 int tmp = INPUT ( ) ;
 99                 Update_Tree ( 1 , tmp ) ;
100                 printf ( "%d\n" , tr[ 1 ].Cnt ) ;
101         }
102         fclose(stdin);
103         fclose(stdout);
104         Never Explode ;
105 }