#include<bits/stdc++.h>
using namespace std;
int n,q,opt,num,ans;
int a[1000000]={0};
void quickSort(int begin,int end)
{
	if (begin>=end)
        return;
	int left=begin;
	int right=end;
	int temp=a[left];
	while (left<right)
        {
		while (left<right&&a[right]>=temp)
		{
			right--;
		}
		if (left<right)
		{
			a[left]=a[right];
		}
		while (left<right&&a[left]<=temp)
		{
			left++;
		}
		if (left<right)
		{
			a[right]=a[left];
		}
		if (left==right)
		{
			a[left]=temp;
		}
	}
	quickSort(begin,left-1);
	quickSort(left + 1,end);
}
int operation()
{
    if(opt==1)
    {
        int flag=1;
        for(int i=0;i<n&&flag==1;i++)
        {
            if(a[i]==num)
            {
                for(int j=i;j<n;j++)
                a[j]=a[j+1];
                flag=0;
                n--;
            }
        }
        if(flag==1)
        return -1;
        else
        {
            quickSort(0,n-1);
            return (2*(a[n-1]-a[0]));
         }
    }
    if(opt==2)
    {
        n++;
        a[n-1]=num;
        quickSort(0,n-1);
        return (2*(a[n-1]-a[0]));
    }
}
int main()
{
        cin >> n >> q;
        for(int i=0;i<n;i++)
            cin >> a[i];
        for(int i=1;i<=q;i++)
        {
            cin >> opt >> num;
            ans=operation();
            cout << ans << endl;
        }

}