#include <bits/stdc++.h>
using namespace std;
const int K = 100;
const int KK = K + 100;
char maze[KK][KK];
bool FFree, SFree;
int sumList[KK];
void checkFree(int n, int m) {
  int i, j, k;
  char c;
  for (i = 0; i < n; i++) {
    c = 'x';
    k = 0;
    for (j = 0; j < m; j++) {
      if (maze[i][j] != '-') {
        if (c == maze[i][j]) {
          k = 2;
          break;
        } else if (c == 'x') {
          c = maze[i][j];
          k = 1;
        } else {
          c = 'x';
          break;
        }
      }
    }
    if (c != 'x' && k < m) {
      if (c == 'G') {
        FFree = true;
      } else if (c == 'R')
        SFree = true;
    }
  }
}
void getSumList(int n, int m) {
  int i, j, k, sum = 0, f;
  char c;
  for (i = 0; i < n; i++) {
    c = 'x';
    k = 0;
    f = 0;
    for (j = 0; j < m; j++) {
      char cc = maze[i][j];
      assert(cc == '-' || cc == 'R' || cc == 'G');
      if (maze[i][j] != '-') {
        if (c == 'x') {
          c = maze[i][j];
          k = 0;
        } else if (c == maze[i][j]) {
          k = 0;
          break;
        } else {
          f = 1;
          break;
        }
      } else if (c != 'x') {
        k++;
      }
    }
    sumList[i] = k * f;
  }
}
int getSumByP(int x, int n) {
  int i, sum = 0;
  for (i = 0; i < n; i++) {
    sum += ((sumList[i] & (1 << x)) > 0);
  }
  return sum;
}
void solve() {
  int n, m, k;
  int i, j;
  while (scanf("%d%d%d", &n, &m, &k) != EOF) {
    assert(1 <= n && n <= K);
    assert(1 <= m && m <= K);
    assert(1 <= k && k <= K);
    for (i = 0; i < n; i++) {
      scanf("%s", maze[i]);
      j = strlen(maze[i]);
      assert(j == m);
    }
    if (m == 1) {
      puts("Second");
      continue;
    }
    FFree = SFree = false;
    checkFree(n, m);
    if (FFree && SFree) {
      puts("Draw");
      continue;
    }
    if (FFree) {
      puts("First");
      continue;
    } else if (SFree) {
      puts("Second");
      continue;
    }
    getSumList(n, m);
    for (i = 0; i < 10; i++) {
      if (getSumByP(i, n) % (k + 1)) break;
    }
    if (i < 10) {
      puts("First");
    } else {
      puts("Second");
    }
  }
}
int main() {
  solve();
  return 0;
}
