#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define MOD 1000000007

int n,m;
int grid[15][15];
int Rows[15];

vector<int> Masks;

int F[15][5001];

bool Compatible(int Row,int Mask)
{
    if ( ( (~Row)&(~Mask) )==(~Row) )
    return true;
    else
    return false;
}

int main()
{
    freopen("art.in","r",stdin);
    freopen("art.out","w",stdout);

    int i,j,in;
    int ans=0;

    scanf("%d %d",&n,&m);

    for (i=1;i<=n;i++)
    {
        for (j=1;j<=m;j++)
        {
            scanf("%d",&grid[i][j]);
        }
    }

    for (i=1;i<=n;i++)
    {
        Rows[i]=0;

        for (j=1;j<=m;j++)
        {
            if (grid[i][j]==1)
            {
                Rows[i]=Rows[i]+(1<<(m-j));
            }
        }
    }

    for (i=0;i<(1<<m);i++)
    {
        if ( ( i&(i*2) )==0 )
        {
            Masks.push_back(i);
        }
    }

    for (i=0;i<Masks.size();i++)
    {
        if (Compatible(Rows[1],Masks[i]))
        {
            F[1][i]=1;
        }
        else
        {
            F[1][i]=0;
        }
    }

    for (i=2;i<=n;i++)
    {
        for (j=0;j<Masks.size();j++)
        {
            if (Compatible(Rows[i],Masks[j]))
            {
                for (in=0;in<Masks.size();in++)
                {
                    if ( ( Masks[j]&Masks[in] )==0 )
                    {
                        F[i][j]+=F[i-1][in];

                        if (F[i][j]>=MOD)
                        F[i][j]-=MOD;
                    }
                }
            }
            else
            {
                F[i][j]=0;
            }
        }
    }

    for (i=0;i<Masks.size();i++)
    {
        ans+=F[n][i];

        if (ans>=MOD)
        ans-=MOD;
    }

    printf("%d\n",ans);

    return 0;
}