#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;
ll powmod(ll x, ll y, ll mod) {
    ll res = 1;
    while (y) {
        if (y & 1) res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
int main() {
    int n, m;
    ll k;
    cin >> n >> m >> k;
    vector<bitset<3000>> A(m);
    for (int i = 0; i < m; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < n; j++) {
            if (s[j] == '1') A[i][j] = 1;
        }
    }
    int rk = 0;
    for (int j = 0; j < n && rk < m; j++) {
        int t = rk;
        while (t < m && !A[t][j]) t++;
        if (t < m) {
            swap(A[rk], A[t]);
            for (int i = rk + 1; i < m; i++) {
                if (A[i][j]) A[i] ^= A[rk];
            }
            rk++;
        }
    }
    cout << powmod(2, n - rk, k) << "\n";
    return 0;
}