#include <bits/stdc++.h>
using namespace std;
const int N = 110;
char s[N][N];
int w[N], sum[10];
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  bool flag1 = false, flag2 = false;
  for (int i = 1; i <= n; i++) {
    scanf("%s", s[i] + 1);
    int t1 = 0, t2 = 0;
    for (int j = 1; j <= m; j++)
      if (s[i][j] != '-') {
        if (!t1)
          t1 = j;
        else
          t2 = j;
      }
    if (!t1) continue;
    if (((!t2) && m > 1) || (s[i][t1] == s[i][t2] && m > 2)) {
      if (s[i][t1] == 'G')
        flag1 = true;
      else
        flag2 = true;
    } else if (t2 && s[i][t1] != s[i][t2])
      w[i] = t2 - t1 - 1;
  }
  if (flag1 || flag2) {
    if (flag1 && flag2)
      printf("Draw\n");
    else if (flag1)
      printf("First\n");
    else
      printf("Second\n");
    return 0;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= 6; j++)
      if (w[i] & (1 << j)) sum[j]++;
  bool flag = false;
  for (int j = 0; j <= 6; j++)
    if (sum[j] % (k + 1)) flag = true;
  if (flag)
    printf("First");
  else
    printf("Second");
  return 0;
}
