#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn = 205;
const int mod = 1e9+7;

int n, cs, cf;
int dp[2][mxn][mxn][mxn];
int ans = 0;

signed main() {
	
	scanf("%d%d%d", &n, &cs, &cf);
	memset(dp, 0, sizeof(dp));
	if (cs > cf) swap(cs,cf);
	dp[0][cs-1][cf-cs-1][n-cf] = 1;
	dp[1][cs-1][cf-cs-1][n-cf] = 1;
	
	for (int rem = n; rem >= 0; rem--) {
		for (int a1 = 0; a1 < n; a1++) {
			for (int a2 = 0; a2 < n; a2++) {
				int dir, a3;
				//dir = 0 : away
				dir = 0;
				if (rem-a1-a2 >= 0)  {
					a3 = rem-a1-a2;
					if (a1) {
						dp[1][a1-1][a2][a3] += dp[dir][a1][a2][a3];
						dp[1][a1-1][a2][a3] %= mod;
					}
				}
				//dir = 1 : towards
				dir = 1;
				if (rem-a1-a2 >= 0) {
					a3 = rem-a1-a2;
					//case 1 - before
					if (a2) {
						dp[0][a1][a2-1][a3] += dp[dir][a1][a2][a3];
						dp[0][a1][a2-1][a3] %= mod;
					}
					//case 2 - after
					for (int na2 = 0; na2 < a3; na2++) {
						int na1 = a3-na2-1;
						int na3 = a1+a2;
						dp[1][na1][na2][na3] += dp[dir][a1][a2][a3];
						dp[1][na1][na2][na3] %= mod;
					}
				}
				if (rem == 0 && rem-a1-a2 >= 0) {
					a3 = rem-a1-a2;
					ans += dp[1][a1][a2][a3];
				}
			}
		}
	}
	
	cout << ans;
	
	return 0;
}