#include <bits/stdc++.h>
#define int long long
#define lowbit(x) x&(-x)
using namespace std;
const int N=1e7+8;
int n,m,k;
int s[N];
int now1,now2;
int popcount(int x){
    int cnt=0;
    while(x||lowbit(x)>((1<<m)-1)){
        cnt++;
        x-=lowbit(x);
    }
    return cnt;
}
int inv(int x){
    return x^((1<<m)-1);
}
signed main(){
    freopen("bitset.in","r",stdin);
    freopen("bitset.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        string num;
        cin>>num;
        s[i]=stoi(num,nullptr,2);
    }
    cin>>k;
    int x,y,z;
    cin>>x>>y>>z;
    int a=1,b=n,ans=0,sum=0;
    for(int i=1;i<=k;i++){
        if(i!=1){
            a=(a*x+ans*y+z)%n+1;
            b=(b*y+ans*z+x)%n+1;            
        }
        now1=s[min(a,b)];
        now2=s[min(a,b)];
        for(int j=min(a,b)+1;j<=max(a,b);j++){
            now1=now1&s[j];
            now2=now2|s[j];
        }
        now1=now1^(inv(now2));
        ans=popcount(now1);
        sum+=ans;
    }
    cout<<sum;
    
    
    return 0;
}