#include <cstdio>
#include <cstring>
using namespace std;
const int N = 60;
const int mod = 1e9 + 7;
int n,K,q;
struct Matrix
{
	int a[N + 5][N + 5];
	inline Matrix(int op = 0)
	{
		if(!op)
			for(int i = 1;i <= n;++i)
				for(int j = 1;j <= n;++j)
					a[i][j] = 0;
		else
			for(int i = 1;i <= n;++i)
				for(int j = 1;j <= n;++j)
					a[i][j] = i == j;
	}
	inline int *operator[](int x)
	{
		return a[x];
	}
	inline const int *operator[](int x) const
	{
		return a[x];
	}
	inline Matrix operator*(int x) const
	{
		Matrix ret;
		for(int i = 1;i <= n;++i)
			for(int j = 1;j <= n;++j)
				ret[i][j] = (long long)x * a[i][j] % mod;
		return ret;
	}
	inline Matrix operator+(const Matrix &o) const
	{
		Matrix ret;
		for(int i = 1;i <= n;++i)
			for(int j = 1;j <= n;++j)
				ret[i][j] = (a[i][j] + o[i][j]) % mod;
		return ret;
	}
	inline Matrix operator*(const Matrix &o) const
	{
		Matrix ret;
		for(int k = 1;k <= n;++k)
			for(int i = 1;i <= n;++i)
				for(int j = 1;j <= n;++j)
					ret[i][j] = (ret[i][j] + (long long)a[i][k] * o[k][j]) % mod;
		return ret;
	}
} G,f[N + 5],f_temp[N + 5];
struct Vector
{
	int a[N + 5];
	inline Vector(int x = 0)
	{
		for(int i = 1;i <= n;++i)
			a[i] = i == x;
	}
	inline int &operator[](int x)
	{
		return a[x];
	}
	inline const int &operator[](int x) const
	{
		return a[x];
	}
	inline Vector operator+(const Vector &o) const
	{
		Vector ret;
		for(int i = 1;i <= n;++i)
			ret[i] = (a[i] + o[i]) % mod;
		return ret;
	}
} f_10[N + 5],f_10_temp[N + 5];
inline Vector operator*(const Vector &a,const Matrix &b)
{
	Vector ret;
	for(int k = 1;k <= n;++k)
		for(int i = 1;i <= n;++i)
			ret[i] = (ret[i] + (long long)a[k] * b[k][i]) % mod;
	return ret;
}
struct VectorT
{
	int a[N + 5];
	inline VectorT(int x = 0)
	{
		for(int i = 1;i <= n;++i)
			a[i] = i == x;
	}
	inline int &operator[](int x)
	{
		return a[x];
	}
	inline const int &operator[](int x) const
	{
		return a[x];
	}
	inline VectorT operator+(const VectorT &o) const
	{
		VectorT ret;
		for(int i = 1;i <= n;++i)
			ret[i] = (a[i] + o[i]) % mod;
		return ret;
	}
} f_01[N + 5],f_01_temp[N + 5];
inline VectorT operator*(const Matrix &a,const VectorT &b)
{
	VectorT ret;
	for(int k = 1;k <= n;++k)
		for(int i = 1;i <= n;++i)
			ret[i] = (ret[i] + (long long)a[i][k] * b[k]) % mod;
	return ret;
}
int f_11[N + 5],f_11_temp[N + 5];
inline int operator*(const Vector &a,const VectorT &b)
{
	int ret = 0;
	for(int k = 1;k <= n;++k)
		ret = (ret + (long long)a[k] * b[k]) % mod;
	return ret;
}
int main()
{
	scanf("%d%d%d",&n,&K,&q);
	for(int i = 1;i <= n;++i)
		for(int j = 1;j <= n;++j)
			scanf("%1d",G[i] + j);
	f_temp[0] = G;
	for(int k = 1;k <= K;++k)
	{
		for(int i = 1;i <= k;++i)
			f[k] = f[k] + f_temp[i - 1];
		f_temp[k] = (f[k] + 1) * (f[k] + 1) * G;
	}
	for(int b_s,s,b_t,t;q;--q)
	{
		scanf("%d%d%d%d",&b_s,&s,&b_t,&t);
		Vector v_s(s),v_g_s = v_s * G;
		VectorT v_t(t),v_g_t = G * v_t;
		for(int k = 1;k <= K;++k)
		{
			f_10[k] = 0;
			for(int i = 1;i <= k;++i)
				f_10[k] = f_10[k] + f_10_temp[i - 1];
			if(b_s <= k)
				f_10[k] = f_10[k] + v_g_s * (f[b_s - 1] + 1);
			f_10_temp[k] = (f_10[k] * G) * (f[k] + 1);
		}
		for(int k = 1;k <= K;++k)
		{
			f_01[k] = 0;
			for(int i = 1;i <= k;++i)
				f_01[k] = f_01[k] + f_01_temp[i - 1];
			if(b_t <= k)
				f_01[k] = f_01[k] + (f[b_t - 1] + 1) * v_g_t;
			f_01_temp[k] = (f[k] + 1) * (G * f_01[k]);
		}
		for(int k = 1;k <= K;++k)
		{
			f_11[k] = 0;
			for(int i = 1;i <= k;++i)
				f_11[k] = (f_11[k] + f_11_temp[i - 1]) % mod;
			if(b_s <= k)
				f_11[k] = (f_11[k] + v_s * f_01[b_s - 1]) % mod;
			if(b_t <= k)
				f_11[k] = (f_11[k] + f_10[b_t - 1] * v_t) % mod;
			if(b_s == b_t && b_s <= k)
				f_11[k] = (f_11[k] + v_s * v_t) % mod;
			f_11_temp[k] = f_10[k] * f_01[k];
		}
		printf("%d\n",f_11[K]);
	}
}