#include <bits/stdc++.h>
using namespace std;
const int N = 111;
char a[N][N];
int n, m, k, fir, sec, fl[N], cnt[N];
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) scanf("%s", a[i] + 1);
  for (int j = 1; j <= n; j++) {
    int uo = 0, u0 = 0, la = 0, wh = 0;
    for (int i = 1; i <= m; i++) {
      if (a[j][i] == 'R') uo++;
      if (a[j][i] == 'G') u0++;
      if (a[j][i] != '-' && a[j][i] != a[j][la]) {
        if (la)
          wh = i - la - 1;
        else
          la = i;
      }
    }
    if (uo < m && uo && !u0) sec = 1;
    if (!uo && u0 && u0 < m) fir = 1;
    for (int i = 0; i < 9; i++) {
      if (wh & (1 << i)) cnt[i]++;
    }
  }
  if (sec && fir) {
    return puts("Draw"), 0;
  }
  if (sec) return puts("Second"), 0;
  if (fir) return puts("First"), 0;
  for (int i = 0; i < 9; i++) {
    if (cnt[i] % (k + 1)) return puts("First"), 0;
  }
  return puts("Second"), 0;
}
