#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;i++)
using namespace std;
inline int read(){
	char c=getchar();
	int asb=0,ctx=1;
	while(c<'0'||c>'9')ctx=(c=='-'?-1:ctx),c=getchar();
	while(c>='0'&&c<='9')asb=asb*10+(c^48),c=getchar();
	return asb*ctx;
}
inline int qp(int x,int y){
	int ans=1;
	while(y){
		if(y&1)ans=ans*x;
		x*=x,y>>=1;
	}
	return ans;
}
int n,m,k[10],p[10],l[4000005],r[4000005],sz[2],ans;
unordered_map<int,int>mp;
void dfs(int(&pp)[4000005],int deep,int tmp,int sum){
	if(deep>(tmp?n:(n>>1)))return pp[++sz[tmp]]=sum,void();
	fo(i,1,m)dfs(pp,deep+1,tmp,sum+k[deep]*qp(i,p[deep]));
}
signed main(){
	n=read(),m=read();
	fo(i,1,n)k[i]=read(),p[i]=read();
	dfs(l,1,0,0),dfs(r,(n>>1)+1,1,0);
	sort(l+1,l+1+sz[0]),sort(r+1,r+1+sz[1]);
	int pos1=sz[0],pos2=1;
	while(pos1&&pos2<=sz[1]){
		while(pos2<=sz[1]&&r[pos2]<-l[pos1])pos2++;
		int ppp=pos1,tmp=0,tmp2=0;
		while(pos2<=sz[1]&&r[pos2]==-l[pos1])pos2++,tmp++;
		while(pos1&&l[pos1]==l[ppp])pos1--,tmp2++;
		ans+=tmp*tmp2;
	}
	cout<<ans;
	return 0;
}