#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

// ---------- begin input macro ----------
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------


use std::cmp::*;
use std::collections::*;
use std::ops::*;
use std::marker::*;
 
const INF: i64 = std::i64::MAX/100;
const MOD: i64 = 1_000_000_007;
// const MOD: i64 = 998_244_353;

fn main() {
    input! {
        n: usize,
        m: usize,
        s: [[usize;m];n],
    }
    let mut dp = vec![0;1<<m];
    dp[0] = 1;
    for i in 0..(1<<m) {
        let mut e = vec![true;n];
        for j in 0..m {
            if (i>>j)%2==0 {
                continue;
            }
            for k in 0..n {
                if s[k][j]==0 {
                    e[k] = false;
                }
            }
        }
        for j in 0..m {
            if (i>>j)%2==1 {
                continue;
            }
            let mut count = 0;
            for k in 0..n {
                if !e[k] {
                    continue;
                }
                if s[k][j]==0 {
                    count -= 1;
                }
                else {
                    count += 1;
                }
            }
            if count >= 0 {
                dp[i|(1<<j)] += dp[i];
            }
        }
    }
    println!("{}",dp[(1<<m)-1]);
}