// compile: make data
// run: ./data < big.in > bit.out
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
#else
#define debug(x...)
#define Debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define MAXN 200010

struct bitree2d {
    int n, m;
    vector<vector<int>> bit;
    bitree2d(vector<vector<int>> &a) {
        n = sz(a), m = sz(a[0]);
        bit.resize(n+1, vector<int>(m+1, 0));
        rep(i, 0, n) rep(j, 0, m) add(i, j, a[i][j]);
    }
    int lowbit(int x) {return x & -x; }
    int prefix(int x, int y) {int res = 0; for (int i = x+1; i; i -= lowbit(i)) for (int j = y+1; j; j -= lowbit(j)) res += bit[i][j]; return res; }
    void add(int x, int y, int val) {for (int i = x+1; i <= n; i += lowbit(i)) for (int j = y+1; j <= m; j += lowbit(j)) bit[i][j] += val; }
    int query(int x0, int y0, int x1, int y1) {return prefix(x1, y1) - prefix(x0-1, y1) - prefix(x1, y0-1) + prefix(x0-1, y0-1); }
};

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n, q; cin >> n >> q;
    vector<vector<int>> a(n, vector<int>(n, 0));
    rep(i, 0, n) {
        string s; cin >> s;
        rep(j, 0, n) a[i][j] = (s[j] == '*');
    }
    bitree2d t(a);
    while (q--) {
        int op; cin >> op;
        if (op == 1) {
            int x, y; cin >> x >> y; --x, --y;
            t.add(x, y, a[x][y] ? -1 : 1);
            a[x][y] ^= 1;
        } else {
            int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1; --x0, --y0, --x1, --y1;
            printf("%lld\n", t.query(x0, y0, x1, y1));
        }
    }

    return 0;
}