uses math;

var
    dp:array[0..101,0..101] of int64;
    a:array[0..101] of longint;
    sum:int64;
    n,m,i,j,k:longint;
    s:ansistring;

 begin

  assign(input,'input.txt'); reset(input);
  assign(output,'output.txt'); rewrite(output);

  readln(n,m);
   for i:=1 to n do
    begin
     readln(s);
      for j:=1 to length(s) do
       if s[j] in['-','+',':','*'] then inc(a[i]);
    end;

     dp[0][0]:=1;

     for i:=1 to n do
      begin
       for j:=0 to i-1 do
        if(a[j]<a[i]) then
         for k:=1 to min(i,m) do
           dp[i][k]:=dp[i][k]+dp[j][k-1];
       end;

        sum:=0;
         for i:=1 to n do
          sum:=sum+dp[i][m];

           if sum = 0 then writeln(-1) else

          writeln(sum);

 end.