#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 111, M = 1111;
int l, m, n, t, C;
char a[N][N], s[N];
pair<int, int> pt[N], pos[M];
int find(int d, int i) {
  pair<int, int> p = pos[i];
  while (a[p.first][p.second] != '#') {
    p.first += DX[d];
    p.second += DY[d];
    if (p == pos[i + 1]) return 1;
  }
  return 0;
}
int calc(char x) {
  if (x >= '0' && x <= '9') return x - '0';
  return 1;
}
int main() {
  scanf("%d%d%d", &m, &n, &l);
  for (int _tmp = m, i = 1; i <= _tmp; ++i)
    for (int _tmp = n, j = 1; j <= _tmp; ++j) {
      for (a[i][j] = getchar();
           a[i][j] != '#' && (a[i][j] < '0' || a[i][j] > '9') &&
           (a[i][j] < 'a' || a[i][j] > 'z');
           a[i][j] = getchar())
        ;
      if (a[i][j] >= 'a' && a[i][j] <= 'z')
        pt[a[i][j] - 'a'].first = i, pt[a[i][j] - 'a'].second = j;
    }
  scanf("%d%d%s", &pos[0].first, &pos[0].second, s + 1);
  n = strlen(s + 1);
  for (int _tmp = n, i = 1; i <= _tmp; ++i) pos[i] = pt[s[i] - 'a'];
  scanf("%d%d", &pos[n + 1].first, &pos[n + 1].second);
  for (int _tmp = n, i = 0; i <= _tmp; ++i) {
    for (int _tmp = 3, k = 0; k <= _tmp; ++k)
      if (find(k, i)) {
        pair<int, int> p = pos[i];
        while (1) {
          if (p == pos[i + 1]) break;
          l -= calc(a[p.first][p.second]);
          if (l < 0) {
            printf("%d %d\n", p.first, p.second);
            return 0;
          }
          p.first += DX[k];
          p.second += DY[k];
        }
      }
  }
  printf("%d %d\n", pos[n + 1].first, pos[n + 1].second);
  return 0;
}
