// poj1186

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<cstdio>

#include<cmath>

#define MOD 10000007

#define LL long long

#define inf 2147483640

#define Pi 3.1415926535898

#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);

using namespace std;

struct hash {int w,next,num;}h[100000010];

int cnt,ans,n,m,head[MOD],p[10],k[10],pd[1010][1010];

void dfs1(int x,int w) {

    if (x>n/2) {

        int i=abs(w)%MOD;

        bool flag=1;

        for (int j=head[i];j;j=h[j].next) if (w==h[j].w) {h[j].num++;flag=0;break;}

        if (flag) {h[++cnt].w=w;h[cnt].next=head[i];head[i]=cnt;h[cnt].num++;}

    }

    else

        for (int i=1;i<=m;i++) dfs1(x+1,w+k[x]*pd[i][p[x]]);

}

void dfs2(int x,int w) {

    if (x>n) {

        int i=abs(w)%MOD;

        for (int j=head[i];j;j=h[j].next) if (-w==h[j].w) {ans+=h[j].num;break;}

    }

    else

        for (int i=1;i<=m;i++) dfs2(x+1,w+k[x]*pd[i][p[x]]);

}

int main() {

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

    for (int i=0;i<=m;i++) {

        pd[i][0]=1;

        for (int j=1;j<=m;j++) pd[i][j]=pd[i][j-1]*i;

    }

    for (int i=1;i<=n;i++) scanf("%d%d",&k[i],&p[i]);

    dfs1(1,0);

    dfs2(n/2+1,0);

    printf("%d",ans);

    return 0;

}