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

//入力が必ず-mod<a<modの時.
template<int idx> //modが入力で与えられる場合. 
struct dynamic_modint{ //mod変更が可能 最初にsetmod必須 idxで複数個所持が可能.
    private:
    static int mod;
    public:
    long long v = 0;
    static constexpr long long getmod(){return mod;}
    static void setmod(int m){
        assert(m > 0);
        mod = m;
    }
    dynamic_modint(){v = 0;}
    dynamic_modint(int a){v = a<0?a+mod:a;} dynamic_modint(long long a){v = a<0?a+mod:a;}
    dynamic_modint(unsigned int a){v = a;}
    dynamic_modint(unsigned long long a){v = a;}
    long long val()const{return v;}
 
    dynamic_modint &operator=(const dynamic_modint &b) = default;
    dynamic_modint operator+()const{return (*this);}
    dynamic_modint operator-()const{return dynamic_modint(0)-(*this);}
    dynamic_modint operator+(const dynamic_modint b)const{return dynamic_modint(v)+=b;}
    dynamic_modint operator-(const dynamic_modint b)const{return dynamic_modint(v)-=b;}
    dynamic_modint operator*(const dynamic_modint b)const{return dynamic_modint(v)*=b;}
    dynamic_modint operator/(const dynamic_modint b)const{return dynamic_modint(v)/=b;}
    dynamic_modint operator+=(const dynamic_modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    dynamic_modint operator-=(const dynamic_modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    dynamic_modint operator*=(const dynamic_modint b){v = v*b.v%mod; return *this;}
    dynamic_modint operator/=(dynamic_modint b){ //b!=0 mod素数が必須.
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
    dynamic_modint operator++(){*this += 1; return *this;}
    dynamic_modint operator--(){*this -= 1; return *this;}
    dynamic_modint operator++(int){*this += 1; return *this;}
    dynamic_modint operator--(int){*this -= 1; return *this;}
    bool operator==(const dynamic_modint b)const{return v == b.v;}
    bool operator!=(const dynamic_modint b)const{return v != b.v;}
    bool operator>(const dynamic_modint b)const{return v > b.v;}
    bool operator>=(const dynamic_modint b)const{return v >= b.v;}
    bool operator<(const dynamic_modint b)const{return v < b.v;}
    bool operator<=(const dynamic_modint b)const{return v <= b.v;}
    dynamic_modint pow(long long n)const{
        dynamic_modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    dynamic_modint inv()const{return dynamic_modint(1)/v;} //素数mod必須.
};
template<int idx> int dynamic_modint<idx>::mod=998244353;
using mint = dynamic_modint<0>;


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M,K; cin >> N >> M >> K; mint::setmod(K);

    using ull = unsigned long long;
    auto flip = [&](vector<ull> s,const vector<ull> &t) -> vector<ull> {
        for(int i=0; i<40; i++) s.at(i) ^= t.at(i);
        return s; 
    };
    
    vector<vector<ull>> S(N,vector<ull>(40));
    {
        int pos1 = 0,pos2 = 63;
        for(int i=0; i<M; i++){
            string s; cin >> s;
            for(int k=0; k<N; k++){
                if(s.at(k) == '1') S.at(k).at(pos1) += 1ULL<<pos2;
            } 
            pos2--; 
            if(pos2 == -1) pos1++,pos2 = 63;
        }
    }

    vector<vector<ull>> X; X.reserve(N);
    mint answer = 1;
    for(auto s : S){    
        for(auto x : X){
            auto s2 = flip(s,x);
            s = min(s,s2);
        }
        bool ok = true;
        for(auto a : s) if(a){ok = false; break;}
        if(ok) answer += answer;
        else X.emplace_back(s);
    }
    cout << answer.v << endl;
}