#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define FORD(i, l, r) for(int i = l; i >= r; i--)
#define db double
#define ldb long double
#define all_1(x) (x).begin() + 1, (x).end()
#define all(x) (x).begin(), (x).end()
#define ins insert
#define pb push_back
template<typename T>void debug_var(const T& var, const string& name){
cerr << name << ": " << var << "\n";
}
template<typename T>void debug_1d(const T& vt, const string& name){
if(vt.empty()){
cerr << name << " is empty!\n";
return;
}
FOR(i, 0, (int)vt.size() - 1){
cerr << name << "[" << i << "]: " << vt[i] << "\n";
}
}
const ll oo = 2e18;
namespace sub2{
ll sol(int n, int start, int d, int attraction[]){
priority_queue<int, vector<int>, greater<int>> pq;
ll ans = 0, sum = 0;
FOR(i, 0, n - 1){
int day_left = d - i;
if(day_left <= 0) break;
sum += attraction[i];
pq.push(attraction[i]);
while((int)pq.size() > day_left){
//remove worst
sum -= pq.top();
pq.pop();
}
ans = max(ans, sum);
}
return ans;
}
}
ll findMaxAttraction(int n, int start, int d, int attraction[]){
if(start == 0) return sub2::sol(n, start, d, attraction);
}
int a[5] = {10, 2, 20, 30, 1};
void solve(){
int n, start, d;
cin >> n >> start >> d;
cout << findMaxAttraction(n, start, d, a) << "\n";
}
/*
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
*/
