Mã vạch

program ma_vach;
const fi='mavach.inp';
      fo='mavach.out';
var l:array[0..33,0..100] of longint;
    i,j,n,m,k,g,gt,c,h,t,sl:integer; fn,fx:text;
    s:string;

procedure timsoluong;
 begin
  for i:=1 to m do for j:=0 to n do l[i,j]:=0;
  l[0,0]:=1;

  for i:=1 to m do
  for j:=i to n do
    for g:=1 to k do
    if g<=j then
      l[i,j]:=l[i,j]+l[i-1,j-g];
  writeln(fx,l[m,n]);
 end;

procedure tinh(s:string);
 begin
  gt:=0; i:=0; g:=1;
  while g<=length(s) do
  begin
    inc(i); h:=g+1;
    while s[h]=s[h-1] do inc(h);
    j:=g; g:=h; h:=h-j;
    if i mod 2=1 then
    begin
      for c:=1 to k do
      if c<h then
        if length(s)-g+1+h-c>=0 then
        gt:=gt+l[m-i,length(s)-g+1+h-c];
    end
    else
    begin
      for c:=1 to k do
      if c>h then
        if length(s)-g+1+h-c>=0 then
        gt:=gt+l[m-i,length(s)-g+1+h-c];
    end;
  end;
  writeln(fx,gt+1);
 end;

begin
 assign(fn,fi);
 reset(fn);
 assign(fx,fo);
 rewrite(fx);
 readln(fn,n,m,k);
 timsoluong;
 readln(fn,sl);
 for t:=1 to sl do
  begin
  readln(fn,s);
  tinh(s);
  end;
 close(fn);
 close(fx);
end.