#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;
#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
/*
notes:
int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string
vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));
{if statement} ? {truth value} : {false value}
#ifdef LOCAL
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
std::lcm(ll a, ll b), std::gcd(int a, int b)
cout << fixed << setprecision(n);
set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);
*/
typedef int64_t ll;
const ll inf = 1e9;
void solve() {
ll n, m, k;
cin >> n >> m >> k;
vector<vector<ll>> v(n, vector<ll>(m, 0));
ll ci = 0, cj = 0;
v[0][0] = 1;
string route;
cin >> route;
ll vis = 1;
for(const auto & dir : route) {
//cerr << "\nci=" << ci << "; cj=" << cj;
ll ni = ci;
ll nj = cj;
if(dir == 'R') {
nj++;
}else if(dir == 'L') {
nj--;
}else if(dir == 'D') {
ni++;
}else if(dir == 'U') {
ni--;
}
if(v[ni][nj] == 0) {
vis++;
}
//cerr << "\nni=" << ni << "; nj=" << nj;
v[ni][nj]++;
//cerr << "\nv[ni][nj]=" << v[ni][nj];
ci = ni;
cj = nj;
}
//cerr << "\nvis=" << vis;
//cerr << "\nv=" << v;
ll unvis = n * m - vis;
k -= unvis;
if(k <= 0) {
cout << route.length();
}else{
ll bi = route.length() - 1;
while(k > 0) {
//cerr << "\nbi=" << bi;
char dir = route[bi];
bi--;
ll ni = ci;
ll nj = cj;
if(dir == 'R') {
nj--;
}else if(dir == 'L') {
nj++;
}else if(dir == 'D') {
ni--;
}else if(dir == 'U') {
ni++;
}
//cerr << "\nni=" << ni << "; nj=" << nj;
if(v[ci][cj] == 1) {
vis--;
k--;
}
v[ci][cj]--;
//cerr << "\nv[ni][nj]=" << v[ni][nj];
ci = ni;
cj = nj;
}
cout << bi+1;
}
}
int main()
{
std::ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
solve();
return 0;
}