Sometimes Mister B has free evenings when he doesn't know what to do. Fortunately, Mister B found a new game, where the player can play against aliens.

All characters in this game are lowercase English letters. There are two players: Mister B and his competitor.

Initially the players have a string s consisting of the first a English letters in alphabetical order (for example, if a = 5, then s equals to "abcde").

The players take turns appending letters to string s. Mister B moves first.

Mister B must append exactly b letters on each his move. He can arbitrary choose these letters. His opponent adds exactly a letters on each move.

Mister B quickly understood that his opponent was just a computer that used a simple algorithm. The computer on each turn considers the suffix of string s of length a and generates a string t of length a such that all letters in the string t are distinct and don't appear in the considered suffix. From multiple variants of t lexicographically minimal is chosen (if a = 4 and the suffix is "bfdd", the computer chooses string t equal to "aceg"). After that the chosen string t is appended to the end of s.

Mister B soon found the game boring and came up with the following question: what can be the minimum possible number of different letters in string s on the segment between positions l and r, inclusive. Letters of string s are numerated starting from 1.

Input

First and only line contains four space-separated integers: a, b, l and r (1 ≤ a, b ≤ 12, 1 ≤ l ≤ r ≤ 109) — the numbers of letters each player appends and the bounds of the segment.

Output

Print one integer — the minimum possible number of different letters in the segment from position l to position r, inclusive, in string s.

Examples

Input

1 1 1 8


Output

2

Input

4 2 2 6


Output

3

Input

3 7 4 6


Output

1

Note

In the first sample test one of optimal strategies generate string s = "abababab...", that's why answer is 2.

In the second sample test string s = "abcdbcaefg..." can be obtained, chosen segment will look like "bcdbc", that's why answer is 3.

In the third sample test string s = "abczzzacad..." can be obtained, chosen, segment will look like "zzz", that's why answer is 1.
#include <bits/stdc++.h>
using namespace std;
char c[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
            'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int a, b, l, r;
int ans = a + b;
void ans1(string s, int u) {
  int vis[30];
  for (int i = 0; i < 26; i++) vis[i] = 0;
  if (s.size() == 3 * (a + b)) {
    int z = 0;
    for (int j = l - 1; j <= r - 1 && j < s.size(); j++) {
      int u = s[j] - 'a';
      if (vis[u] == 0) {
        z++;
        vis[u] = 1;
      }
    }
    ans = min(ans, z);
    return;
  }
  int xx = s.size() - a;
  for (int i = s.size() - 1; i >= xx; i--) {
    int u = s[i] - 'a';
    vis[u] = 1;
  }
  if (u == 1) {
    for (int i = 1; i <= a; i++) {
      for (int j = 0; j < 26; j++) {
        if (vis[j] == 0) {
          vis[j] = 1;
          s += c[j];
          break;
        }
      }
    }
    ans1(s, 0);
  } else {
    for (int j = 0; j < 26; j++) {
      string w = s;
      for (int i = 1; i <= b; i++) w += c[j];
      ans1(w, 1);
    }
  }
}
int main() {
  cin >> a >> b >> l >> r;
  int p = a + b;
  int q = l / p;
  q = q * (a + b);
  l = l - q;
  r = r - q;
  if (l == 0 && r != 0) {
    l = a + b;
    r += a + b;
  }
  if (r == 0) {
    r = a + b;
    l = a + b;
  }
  string s1;
  for (int i = 0; i < a; i++) s1 += c[i];
  ans = 100000000;
  ans1(s1, 0);
  cout << ans << '\n';
}
