#include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<int> piles;
vector<int> bits(8, 0);
string line;
void sum_bits(int x) {
  for (int p = 0; p < 8; ++p) {
    if (x & (1 << p)) ++bits[p];
  }
}
bool find_winner() {
  for (auto pile : piles) {
    sum_bits(pile);
  }
  for (auto sum : bits) {
    if (sum % (k + 1)) return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> k;
  if (m == 1) {
    cout << "Second\n";
    return 0;
  }
  bool dreds = false;
  bool dgreen = false;
  bool ireds = false;
  bool igreen = false;
  bool npiles = true;
  for (int i = 0; i < n; ++i) {
    cin >> line;
    int reds = -1, greens = -1;
    for (int j = 0; j < m; ++j) {
      if (line[j] == 'R') {
        if (reds >= 0) {
          if (m > 2) {
            dreds = true;
          }
          reds = -1;
          break;
        } else
          reds = j;
      }
      if (line[j] == 'G') {
        if (greens >= 0) {
          if (m > 2) {
            dgreen = true;
          }
          greens = -1;
          break;
        } else
          greens = j;
      }
      if (greens >= 0 && reds >= 0) {
        piles.push_back(abs(greens - reds) - 1);
        npiles = false;
        break;
      }
    }
    if (reds == -1 && greens != -1 && !dgreen) igreen = true;
    if (greens == -1 && reds != -1 && !dreds) ireds = true;
  }
  if ((dgreen && dreds) || (ireds && igreen) || (igreen && dreds) ||
      (dgreen && ireds)) {
    cout << "Draw\n";
  } else if (npiles) {
    if (igreen)
      cout << "First";
    else
      cout << "Second\n";
  } else if (igreen || dgreen || find_winner()) {
    if (dreds || ireds)
      cout << "Second\n";
    else
      cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
