#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
template<typename T,typename U> T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U> T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S> bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S> bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}
 
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=2505,M=1e5+5,inf=0x3f3f3f3f;
int T,n,m,k,f[N][N],t[N][N],s[M],v[M];
vp ve[M];
vi vd[M];

void add(int l,int r,int u,int d,int w) {
  f[l][u]+=w, f[r+1][d+1]+=w;
  f[l][d+1]-=w, f[r+1][u]-=w;
}
int lb(int x) {return x&-x;}
void sadd(int x) {for(;x;x-=lb(x)) s[x]++;}
void sdel(int x) {for(;x;x-=lb(x)) s[x]--;}
int qry(int x,int y=0) {for(;x<=m;x+=lb(x)) y+=s[x]; return y;}

namespace SegT {
  int ls[N<<1],rs[N<<1],s[N<<1],tot=1;
  multiset<int> f[N<<1];
  void mdf(int p,int l,int r,int x,int y) {
    if(l==r) {
      if(y>0) f[p].insert(y);
      else f[p].erase(f[p].find(-y));
      s[p]=(f[p].size()?(*f[p].begin()):inf);
      return;
    } int mid=l+r>>1;
    if(x<=mid) mdf(ls[p],l,mid,x,y);
    else if(x>mid) mdf(rs[p],mid+1,r,x,y);
    s[p]=min(s[ls[p]],s[rs[p]]);
  }
  int qry(int p,int l,int r,int x,int y) {
    if(l==x&&r==y) return s[p]; int mid=l+r>>1;
    if(y<=mid) return qry(ls[p],l,mid,x,y);
    else if(x>mid) return qry(rs[p],mid+1,r,x,y);
    else return min(qry(ls[p],l,mid,x,mid),qry(rs[p],mid+1,r,mid+1,y));
  }
  void init(int p,int l,int r) {
    s[p]=inf; if(l==r) return; int mid=l+r>>1;
    init(ls[p]=++tot,l,mid), init(rs[p]=++tot,mid+1,r);
  }
}

signed main() {
  n=read(), k=read(), m=read();
  rep(i,1,m) {
    int K=read(); vp p;
    rep(i,1,K) {
      int x=read(), y=read();
      p.eb(pii(x,y));
    }
    rep(s,1,(1<<K)-1) {
      int l=1,r=N,u=1,d=N,w=popcnt(s)&1?1:-1;
      rep(i,0,K-1) if(s&(1<<i)) {
        chmin(r,p[i].fi), chmax(l,p[i].fi-k+1);
        chmin(d,p[i].se), chmax(u,p[i].se-k+1);
      }
      if(l<=r&&u<=d) add(l,r,u,d,w);
    }
  }
  rep(i,1,n) rep(j,1,n) f[i][j]+=f[i-1][j];
  rep(i,1,n) rep(j,1,n) f[i][j]+=f[i][j-1];
  T=read();
  rep(i,1,T) {
    int opt=read();
    if(opt==1) {
      int x=read(), y=read();
      ve[max(1,x-k+1)].eb(y,i);
      ve[x+1].eb(y,-i);
    } else v[i]=read();
  }
  SegT::init(1,1,n);
  rep(i,1,n-k+1) {
    for(auto [x,y]:ve[i]) SegT::mdf(1,1,n,x,y);
    rep(j,1,n-k+1) t[i][j]=SegT::qry(1,1,n,j,j+k-1);
  }
  rep(i,1,n-k+1) rep(j,1,n-k+1) {
    if(f[i][j]) {
      if(t[i][j]>T) t[i][j]=T+1;
      vd[t[i][j]].eb(f[i][j]);
      sadd(f[i][j]);
    }
  }
  rep(i,1,T) {
    for(int x:vd[i]) sdel(x);
    if(v[i]) {
      int tot=(n-k+1)*(n-k+1);
      int cnt=qry(v[i]);
      printf("%.5lf\n",1.*cnt/tot);
    }
  }
  return 0;
}