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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
static const int MAX_N = 16;
static const int MAX_M = 16;
static const int INF = 10001;

int d[MAX_M][MAX_N];

int h, w, a, b;

ll bfs(vector<vector<int>> input, int a, int b, int cnt, int i, int j){
    ll ans = 0;
    if (a == 0 && b == 0) {
        if (cnt == h*w) {
            /*for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    cout << input.at(i).at(j) << " ";
                }
                cout << endl;
            }*/
            return 1;
        }
        else return 0;
    }
    //for (int i = x; i < h; i++) {
        //for (int j = 0; j < w; j++) {
                //if (i == x && j <= y) continue;
    while (i < h && j < w) {
        if (a > 0) {
            if (input.at(i).at(j) == 0 && j < w - 1 && input.at(i).at(j+1) == 0) {
                vector<vector<int>> tmp = input;
                tmp.at(i).at(j) = 1;
                tmp.at(i).at(j+1) = 1;
                ans += bfs(tmp, a-1, b, cnt+2, i, j+1);
                //cout << a << endl;
            }
            if (input.at(i).at(j) == 0 && i < h - 1 && input.at(i+1).at(j) == 0) {
                vector<vector<int>> tmp = input;
                tmp.at(i).at(j) = 1;
                tmp.at(i+1).at(j) = 1;
                ans += bfs(tmp, a-1, b, cnt+2, i, j);
            }
        }
        if (b > 0) {
            if (input.at(i).at(j) == 0) {
                vector<vector<int>> tmp = input;
                tmp.at(i).at(j) = 2;
                ans += bfs(tmp, a, b-1, cnt+1, i, j);
            }
        }
        j++;
        if (j >= w) {
            j = 0;
            i++;
        }
    }
            //}
        //}
    return ans;
}


int main() {
    cin >> h >> w >> a >> b;
    vector<vector<int>> input(h, vector<int>(w, 0));
    ll ans = bfs(input, a, b, 0, 0 ,0);
    cout << ans << endl;
    return 0;
}

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define For(i,k,j) for(int i=(k);i<=(j);i++)
#define Foe(i,u) for(int i=lst[u],v=e[i].v;i;i=e[i].nxt,v=e[i].v)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define Fin(s) freopen(s,"r",stdin)
#define Fout(s) freopen(s,"w",stdout)
#define file(s) Fin(s".in"),Fout(s".out")
#define INF ((1ll<<60)-1)
#define int long long
const int P=998244353; //
using namespace std;
template<typename T>inline void ckmax(T &a,T b) {(a<b)&&(a=b);}
template<typename T>inline void ckmin(T &a,T b) {(a>b)&&(a=b);}
inline int mul(int a,int b) {return 1ull*a*b%P;}
inline int add(int a,int b) {return a+b>=P?a+b-P:a+b;}
inline int sub(int a,int b) {return a-b>=0?a-b:a-b+P;}
inline void mulmod(int &a,int b) {a=mul(a, b);}
inline void addmod(int &a,int b) {((a+=b)>=P)&&(a-=P);}
inline void submod(int &a,int b) {((a-=b)<0)&&(a+=P);}
inline int ksm(int a,int b) {int ans=1; for(;b;b>>=1) {if(b&1) ans=1ll*ans*a%P;a=1ll*a*a%P;}return ans;}
inline void fprint(const int &x,char c=' ') {fprintf(stderr,"%d%c",x,c);}
inline void fprint(const pii &x,char c='\n') {fprintf(stderr,"%d %d%c",x.first,x.second,c);}
inline void fprint(const int *f,const int &n,char c='\n') {for(int i=1;i<=n;i++) fprint(f[i]); fprintf(stderr,"%c",c);}
inline void fprint(const vector<int> &f,char c='\n') {for(int i=0;i<(int)f.size();i++) fprint(f[i]); fprintf(stderr,"%c",c);}
inline int inv(int a) {return ksm(a,P-2);}
namespace FastIO {
  const int SIZE=1<<16; char buf[SIZE],obuf[SIZE],str[64]; int bi=SIZE,bn=SIZE,opt;
  int read(char *s) {
    while (bn) {for (;bi<bn&&buf[bi]<=' ';bi++);if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}
    int sn=0;while (bn) {for (;bi<bn&&buf[bi]>' ';bi++) s[sn++]=buf[bi];if (bi<bn) break; bn=fread(buf,1,SIZE,stdin),bi=0;}s[sn]=0;return sn;
  }
  bool read(int& x) {if(x)x=0;int bf=0,n=read(str); if(!n) return 0; int i=0; if (str[i]=='-') bf=1,i=1; for(x=0;i<n;i++) x=x*10+str[i]-'0'; if(bf) x=-x; return 1;}
  void write(int x) {
    if(!x) obuf[opt++]='0'; else {if(x<0) obuf[opt++]='-',x=-x;int sn=0; while(x)str[sn++]=x%10+'0',x/=10;for (int i=sn-1;i>=0;i--) obuf[opt++]=str[i];}
    if (opt>=(SIZE>>1)){fwrite(obuf,1,opt,stdout); opt=0;}
  }
  void write(char x) {obuf[opt++]=x;if (opt>=(SIZE>>1)){fwrite(obuf,1,opt,stdout); opt=0;}}
	void Fflush() {if (opt) fwrite(obuf,1,opt,stdout); opt=0;}
};
inline int read() {int x; FI(x); return x;}
const int MN=3e5+5;
int cnt[25],n,m; char s[25];
signed main() {
	#ifndef ONLINE_JUDGE
		freopen("pro.in","r",stdin);
		freopen("pro.out","w",stdout);
	#endif
	n=read(),m=read();
	For(i,1,n) {
		FI(s+1); int nowcnt=0;
//		cerr<<(s+1)<<endl;
		For(j,1,m) nowcnt+=s[j]-'0';	
//		cerr<<nowcnt<<endl;
		cnt[nowcnt]++;	
	}
	int ans=0;
	For(i,0,m) {
		For(j,i,m) {
			if((i+j)&1) {
				ans+=cnt[i]*cnt[j];	
			}
		}
	}
	cout<<ans<<endl;
	return FastIO::Fflush(),0; 
}
/*

*/
