using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (h, w, k) = (c[0], c[1], c[2]);
        var s = SList(h);
        var dp = new long[h][][];
        for (var i = 0; i < dp.Length; ++i)
        {
            dp[i] = new long[w][];
            for (var j = 0; j < dp[i].Length; ++j) dp[i][j] = new long[k];
        }
        dp[0][0][k - 1] = 1;
        var mod = 998_244_353;
        for (var i = 0; i < h; ++i) for (var j = 0; j < w; ++j) for (var p = 0; p < k; ++p)
        {
            if (i + 1 < h)
            {
                if (s[i + 1][j] == '.') dp[i + 1][j][p] = (dp[i + 1][j][p] + dp[i][j][p]) % mod;
                else if (s[i + 1][j] == 'o' && p > 0) dp[i + 1][j][p - 1] = (dp[i + 1][j][p - 1] + dp[i][j][p]) % mod;
            }
            if (j + 1 < w)
            {
                if (s[i][j + 1] == '.') dp[i][j + 1][p] = (dp[i][j + 1][p] + dp[i][j][p]) % mod;
                else if (s[i][j + 1] == 'o' && p > 0) dp[i][j + 1][p - 1] = (dp[i][j + 1][p - 1] + dp[i][j][p]) % mod;
            }
        }
        var ans = 0L;
        for (var i = 0; i < dp[h - 1][w - 1].Length; ++i) ans = (ans + dp[h - 1][w - 1][i]) % mod;
        WriteLine(ans);
    }
}