#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
#define all(c) (c).begin(),(c).end()
int n,m;
string bckp;
vector<string> inp,current,res;
int k[10];
char swaps(char s)
{
    return s == '1' ? '0' : '1';
}
void solve(int i,int bits,int pos)
{
    if(bits == k[i])
    {
        current.push_back(inp[i]);
        return;
    }
    if(pos == n) return;
    inp[i][pos] = swaps(inp[i][pos]);
    solve(i,bits+1,pos+1);
    solve(i,bits,pos+1);
}
int main()
{
    string temp;
    cin >> n >> m;
    for(int i = 0 ; i < m ; i++)
    {
        cin >> temp;
        inp.push_back(temp);
        cin >> k[i];
    }
    bckp = inp[0];
    solve(0,0,0);
    inp[0] = bckp;
    res = current;
    sort(all(res));
    for(int i = 1 ; i < m ; i++)
    {
        bckp = inp[i];
        solve(i,0,0);
        inp[i] = bckp;
        sort(all(current));
        set_intersection(all(res),all(current),res.begin());
        current.clear();
    }
    for(int i = 0 ; i < m ; i++)
    {
        res.erase(find(all(res),inp[i]));
    }
    cout << res.size();
}