program piskovorky;

const maxn=200;maxm=300;

type znaky=(e,x,o);

var A:array[1..maxn,1..maxm] of znaky;

var janko,marienka:integer;

    ii,l:integer;



function funcase(i,j,k:integer; var jan,mar:integer):boolean;

var fun:boolean;

 begin

  fun:=false;

  case A[i,j] of

   x: begin mar:=0; inc(jan);

            if (jan=k) then begin inc(janko); fun:=true; end; end;

   o: begin jan:=0; inc(mar);

            if (mar=k) then begin inc(marienka); fun:=true; end; end;

   e: begin jan:=0; mar:=0; end;

  end;

  funcase:=fun;

 end;



procedure spracuj(m,n,k:integer);

var jan, mar:integer;

    i,i1,j,j1:integer;

 begin

  for i:=1 to n do {horizontalne piskvorky}

   begin

    jan:=0; mar:=0;

    for j:=1 to m do if funcase(i,j,k,jan,mar) then exit;

   end;

  for j:=1 to m do {vertikalne piskvorky}

   begin

    jan:=0; mar:=0;

    for i:=1 to n do if funcase(i,j,k,jan,mar) then exit;

   end;

  for j:=1 to n do {hlavna uhlopriecka 1.}

   begin

    i1:=n+1; j1:=j+1; jan:=0; mar:=0;

    for i:=1 to j do

     begin dec(i1); dec(j1); if funcase(i1,j1,k,jan,mar) then exit; end;

   end;

  for j:=2 to m-n do {hlavna uhlopriecka 2.}

   begin

    i1:=0; j1:=j-1; jan:=0; mar:=0;

    for i:=1 to n do

     begin inc(i1); inc(j1); if funcase(i1,j1,k,jan,mar) then exit; end;

   end;

  for i:=1 to n do {hlavna uhlopriecka 3.}

   begin

    i1:=i+1; j1:=m+1; jan:=0; mar:=0;

    for j:=1 to i do

     begin dec(i1); dec(j1); if funcase(i1,j1,k,jan,mar) then exit; end;

   end;

  for i:=1 to n do {vedlajsia uhlopriecka 1.}

   begin

    i1:=i+1; j1:=0; jan:=0; mar:=0;

    for j:=1 to i do

     begin dec(i1); inc(j1); if funcase(i1,j1,k,jan,mar) then exit; end;

   end;

  for j:=2 to m-n do {vedlajsia uhlopriecka 2.}

   begin

    j1:=j-1; i1:=n+1; jan:=0; mar:=0;

    for i:=1 to n do

     begin dec(i1); inc(j1); if funcase(i1,j1,k,jan,mar) then exit; end;

   end;

  for j:=1 to n do {vedlajsia uhlopriecka 3.}

   begin

    i1:=n-j; j1:=m+1; jan:=0; mar:=0;

    for i:=1 to j do

     begin dec(j1); inc(i1); if funcase(i1,j1,k,jan,mar) then exit; end;

   end;

 end;



procedure readchar(i,j:integer; leq:boolean);

var ch:char;

 begin

  read(ch);

  case ch of

   'x': if leq then A[i,j]:=x else A[j,i]:=x;

   'o': if leq then A[i,j]:=o else A[j,i]:=o;

   '.': if leq then A[i,j]:=e else A[j,i]:=e;

  end;

 end;



procedure nacitaj;

var i,j,k,m,n:integer;

    leq:boolean;

 begin

  readln(m,n,k);

  if n<=m then leq:=true else leq:=false; {mozem si otocit papier aby n<=m}

  for i:=1 to n do

   begin for j:=1 to m do readchar(i,j,leq); readln; end;

  if leq then spracuj(m,n,k) else spracuj(n,m,k);

 end;



begin

 if Paramcount>0 then assign(input,ParamStr(1))

 else assign(input,'a1.txt');

 reset(input);

 janko:=0; marienka:=0;

 readln(l);

 for ii:=1 to l do nacitaj;

 writeln(janko,':',marienka);

 close(input);

end.