// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#define int long long
using namespace std;

vector<int> dp,hossz;

void build(int i, int h, int n){
    if(h==n){
        dp[i]=0;
        return;
    }
    dp[i]=n-h;
    build(i*2,h+1,n);
    build(i*2+1,h+1,n);
}

void query(int i, vector<int>& ut,int indinut, int u, int L){
    //cout<<i<<' ';
    if(i==u){
        dp[i/2]=max(dp[i]+L,dp[i/2]);
        hossz[i]=L;
        return;
    }
    query(i*2+ut[indinut],ut,indinut+1,u,L);
    dp[i]=max({dp[i*2]+hossz[i*2],dp[i*2+1]+hossz[i*2+1]});
    return;
}

signed main() {
    int n,q;cin>>n>>q;
    dp.resize((1<<n)+1);
    hossz.resize((1<<n)+1,1);
    build(1,1,n);
    while(q--){
        int u,L;cin>>u>>L;
        vector<int> ut;
        int temp=u;
        while(temp!=1){
            ut.push_back(temp%2); //0:balra, 1:jobbra
            temp/=2;
        }
        reverse(ut.begin(),ut.end());
        //for(int i : ut)cout<<i<<' ';
        //out<<endl;
        query(1,ut,0,u,L);
        cout<<dp[1]<<endl;
    }
}