stdin.ReadLine()
|> int
|> fun x -> x % 1000
|> fun x -> if x = 0 then 0 else 1000 - x
|> printfn "%d"

let rec solve (ac, wa, tle, re) list =
  match list with
  | "AC"::xx -> solve (ac + 1, wa, tle, re) xx
  | "WA"::xx -> solve (ac, wa + 1, tle, re) xx
  | "TLE"::xx -> solve (ac, wa, tle + 1, re) xx
  | "RE"::xx  -> solve (ac, wa, tle, re + 1) xx
  | _::xx -> solve (ac, wa, tle, re) xx
  | [] -> (ac, wa, tle, re)

let numOfAns = stdin.ReadLine() |> int
[for _ in 1 .. numOfAns -> stdin.ReadLine()]
  |> solve (0, 0, 0, 0)
  |> fun (ac, wa, tle, re) ->
    printfn "AC x %d\nWA x %d\nTLE x %d\nRE x %d" ac wa tle re

let [| h; w; k |] = stdin.ReadLine().Split(" ") |> Array.map int

let f =
    [| 0 .. (h - 1) |]
    |> Array.map (fun row ->
      stdin.ReadLine().ToCharArray()
      |> Array.indexed
      |> Array.map (fun (col, cell) -> (row, col, string cell)))
    |> Array.reduce Array.append


let rec toMaskIndex num indexes mask =
  let d = pown 2 num
  let next = num - 1
  match num with
    | -1 -> indexes
    | num -> if mask >= d then toMaskIndex next (num::indexes) (mask - d) else toMaskIndex next indexes mask

let isUse rows cols (r, c, _) =
  let hasRow = List.exists (fun elem -> elem = r) rows
  let hasCol = List.exists (fun elem -> elem = c) cols
  hasRow && hasCol

let isBlack (_, _, cell) = cell = "#"

let countBlack field (row, col) =
  let rows = toMaskIndex h [] row
  let cols = toMaskIndex w [] col
  field
  |> Array.filter (isUse rows cols)
  |> Array.filter isBlack
  |> Array.length

[
  for k in 0 .. ((pown 2 h) - 1) do
    for j in 0 .. ((pown 2 w) - 1) -> (k, j)
]
|> List.map (countBlack f)
|> List.filter (fun x -> x = k)
|> List.length
|> printfn "%d"