rt,90pts,求
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n, l, r;
cin >> n >> l >> r;
int maxn = -1;
for (long long i = r; i >= l; --i){
long long a = i / n;
int b = i - a * n;
maxn = max(maxn, b);
if (maxn == n - 1) break;
}
cout << maxn << endl;
return 0;
}