#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all> 
using mint = atcoder::modint998244353;
#define int long long
struct Segtree {
  vector<vector<int>> num;
  vector<int> p;
  int n;
  Segtree(int N) {
    n = N;
    num.resize(n);
    p.resize(n+1);
    p[0] = 1;
    for(int i = 0; i < n; i++) p[i+1] = p[i]*2;
    for(int i = 0; i < n; i++) num[i].assign(p[i],0);
  }
  void add(int x, int y) {
    num[n-1][x] = num[n-1][x]+y;
    int t = x;
    for(int i = n-2; i >= 0; i--) {
      t/=2;
      num[i][t] = num[i+1][t*2]+num[i+1][t*2+1];
    }
  }
  int sum_calc(int t, int l, int r, int x, int y) {
    int m = (l+r)/2;
    if(t == n) return 0;
    if(x <= l && r <= y) return num[t][l/p[n-t-1]];
    if(r <= x || y <= l) return 0;
    return sum_calc(t+1,l,m,x,y)+sum_calc(t+1,m,r,x,y);
  }
  int sum(int l, int r) {
    return sum_calc(0,0,p[n-1],l,r);
  }
};

signed main() {
  int n,Q,L;
  cin >> n >> Q >> L;
  Segtree f(20),g(20);
  for(int i = 0; i < n; i++) {
    int x;
    cin >> x;
    f.add(x,1);
    g.add(x,x);
  }
  string ans = "Not Found!";
  while(Q--) {
    int t;
    cin >> t;
    if(t == 1) {
      int x;
      cin >> x;
      f.add(x,1);
      g.add(x,x);
    }
    else if(t == 2) {
      int l,r;
      cin >> l >> r;
      r++;
      cout << f.sum(l,r) << ' ' << g.sum(l,r) << endl;
      ans = "";
    }
    else {
      int x;
      cin >> x;
      continue;
    }
  }
  cout << ans << endl;
}