#include <iostream>
using namespace std;
long long n,m,yi=0,ling=0,r=0,w=0;
char q;
int search(long long a,long long b,long long num,long long c)
{
 if(a>0)
 {
  if(c==0)
  num=num+1;
  search(a-1,b,num,1);
 }
 if(b>0)
 {
  if(c==1)
  num=num+1;
  search(a,b-1,num,0);
 }
 if(a==0&&b==0&&num==m)
 {
  r=(r+1)%1000000000;
 }
 if(a==0&&b==0&&num!=m)
 {
  w=(w+1)%1000000000;
 }
}
int main()
{
 freopen("sleeping.in","r",stdin);
 freopen("sleeping.out","w",stdout);
 cin>>n>>m;
 for(int i=1;i<=n;i++)
  {
   cin>>q;
   if(q=='0')
   ling++;
   else
   if(q=='1')
   yi++;
  }
 search(yi,ling,0,-1);
 cout<<r<<' '<<w<<endl;
}