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

#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

int H,W;
int Q;
int S[3][1010][1010];
char F[1010][1010];
signed main(){
    scanf("%lld%lld%lld",&H,&W,&Q);
    rep(i,H)rep(j,W){
        scanf(" %c",&F[i][j]);
        int t;
        if(F[i][j]=='J')t=0;
        if(F[i][j]=='O')t=1;
        if(F[i][j]=='I')t=2;
        S[t][i+1][j+1]++;
        rep(k,3)S[k][i+1][j+1]+=S[k][i][j+1]+S[k][i+1][j]-S[k][i][j];
    }

    while(Q--){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        a--;b--;
        rep(i,3){
            if(i)printf(" ");
            printf("%lld",S[i][c][d]-S[i][c][b]-S[i][a][d]+S[i][a][b]);
        }
        puts("");
    }
    return 0;
}