#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n, m, k, a[maxn];
char s[maxn + 1];
bool win_r, win_g;
int main(void) {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%s", s);
    if (count(s, s + m, 'R') && count(s, s + m, 'G')) {
      a[i] = abs(find(s, s + m, 'R') - find(s, s + m, 'G')) - 1;
    } else if (count(s, s + m, 'R')) {
      if (count(s, s + m, '-')) {
        win_r = true;
      }
    } else if (count(s, s + m, 'G')) {
      if (count(s, s + m, '-')) {
        win_g = true;
      }
    }
  }
  if (win_g && win_r) {
    puts("Draw");
    return 0;
  }
  for (int i = 0; i < 10; ++i) {
    int cnt = 0;
    for (int j = 0; j < n; ++j) {
      cnt += (a[j] >> i & 1);
    }
    if (cnt % (k + 1)) {
      if (win_r) {
        puts("Second");
      } else {
        puts("First");
      }
      return 0;
    }
  }
  if (!win_g) {
    puts("Second");
  } else {
    puts("First");
  }
  return 0;
}
