#include<bits/stdc++.h>
#define int long long
#define ld long double
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define fi first
#define se second
#define TII tuple<int, int, int>
#define MT make_tuple
#define mp make_pair
#define ts to_string
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define MIN(x) *min_element(all(x))
#define MAX(x) *max_element(all(x))
#define lb lower_bound
#define ub upper_bound
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 205, MOD = 1e9 + 7;
int dp[N][N][N][2];
void cadd(int &x, int y) {
x += y;
if(x >= MOD) x -= MOD;
}
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
// freopen("kangaroo.in", "r", stdin);
// freopen("kangaroo.out", "w", stdout);
int n, cs, ct; cin >> n >> cs >> ct;
dp[2][1][2][1] = dp[2][2][1][0] = 1;
for(int len = 3; len <= n; len++) {
for(int s = 1; s <= len; s++) {
for(int t = s + 1; t <= len; t++) {
for(int k = 0; k < 2; k++) {
if(s >= t) continue;
if(k == 0) {
for(int i = 1; i < s; i++) cadd(dp[len][s][t][k], dp[len - 1][i][t - 1][1 - k]);
} else {
for(int i = s + 1; i <= len; i++) cadd(dp[len][s][t][k], dp[len - 1][i - 1][t - 1][1 - k]);
}
}
}
for(int t = 1; t < s; t++) {
for(int k = 0; k < 2; k++) dp[len][s][t][k] = dp[len][len + 1 - s][len + 1 - t][1 - k];
}
}
}
// cout << dp[3][3][2][0] << endl;
// cout << dp[4][2][3][1] << endl;
cout << (dp[n][cs][ct][0] + dp[n][cs][ct][1]) % MOD << '\n';
return 0;
}
