Uva12627

#include <stdio.h>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
vector<int> v;
int trh(int x,int k) {//k为时间，x为行，递归解决
	int n =1;
	int sum = 0;
	if (k == 0)
		return 1;
	for (int i = k-1; i > 0; i--) {
		n *= 2; 
	}
	if (x <= n) {
		sum = 2 * trh(x,k-1);
	}
	else
	{
		sum = trh(x-n,k-1);
	}
}
int main(void) {
	int k;
	cin >> k;
	int x,y;
	cin >> x >> y;
	int result = 0;
	for (int i = x; i <= y; i++) {
		result += trh(i, k);
	}
	cout << result;
	system("pause");
}