#9 is TLE

#include<bits/stdc++.h>
using namespace std;
long long n, l, r, maxa = INT_MIN;
bool k = false;
int main() {
	cin >> n >> l >> r;
	for (int i = r; i >= r - n - 1 && i >= l; i--) {
		maxa = max(i % n, maxa);
		if (i % n == maxa && i < r)k = true;
		if (i % n < maxa && k == true)break;
	}
	cout << maxa;
	return 0;
}