#include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include <cmath>


typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<vector<int >> vvi;
#define umap unordered_map
#define uset unordered_set
#define parth ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define p0(a) cout << a << " "
#define p1(a) cout << a << "\n"
#define p2(a, b) cout << a << " " << b << "\n"
#define p3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define c1(a) cin >> a
#define c2(a,b) cin >> a >> b
#define c3(a,b,c) cin >> a >> b >> c
#define c4(a,b,c,d) cin >> a >> b >> c >> d

#define forz(i, n) for (ll i = 0; i < n; i++)
#define fore(i, m, n) for (ll i = m; i <= n; i++)
#define forr(i, n, m) for (ll i = n; i >= m; i--)
#define itor(it,x) for(auto it=x.begin(); it!=x.end(); it++)
#define itor2(it,x) for(auto it=x->begin(); it!=x->end(); it++)

#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define mod2 998244353
#define INF 10e20
#define PI 3.141592653589793
#define E 2.71828
//getline(cin, s);
void swap(ll *a, ll *b)
{
  ll temp;
  temp = *a;
  *a = *b;
  *b = temp;
}

bool isPrime(ll n)
{
  ll temp = sqrt(n) + 1;
  for (ll i = 2 ; i < temp ; i++)
  {
    if (n % i == 0) return false;
  }
  return true;

}


void solve() {
  ll n, q;
  c2(n, q);
  ll a[n];
  umap<int, ll> m;

  forz(i, n) {
    c1(a[i]);
    m[a[i]]++;
  }
  pair<ll, ll> p[q];


  forz(i, q) {
    c2(p[i].F, p[i].S);

  }


  forz(i, q) {
    if (p[i].F == 1) {
      if (a[p[i].S - 1] == 1) {
        m[1]--;
        m[0]++;
      } else {
        m[1]++;
        m[0]--;
      }
      a[p[i].S - 1] = 1 - a[p[i].S - 1];

    }
    else {
      if (p[i].S > m[1]) {
        p1(0);
      } else {
        p1(1);
      }
    }
  }

}



int main() {
  parth;
#ifndef ONLINE_JUDGE
  freopen("input1.txt", "r", stdin);
  freopen("output1.txt", "w", stdout);
#endif
  ll t ;
  //c1(t);
  t = 1;

  while (t--) solve();

  return 0;

}
