import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, A, B;
real[] X, Y;

void doIt(int l, int x, int y, int r, int s0, int s1, int dir) {
  debug {
    writeln(l, " ", x, " ", y, " ", r, " ", s0, " ", s1, " ", dir);
  }
  
  /*
    l 点 (---- 20 くらい ----) x 点 (いい感じのとこに 1 点) y 点
    あとは x 点を適当に左に動かす
  */
  
}

void main() {
  debug {
    foreach (n; 1 .. 20) {
      foreach (b; (n * (n - 1) + 3) / 4 + n .. n * (n - 1) / 2 + 1) {
        writefln("n = %d, b = %d", n, b);
        int mn = n * n, mx = 0;
        foreach (l; 0 .. n + 1) {
          foreach (x; 0 .. (n - l - 1) + 1) {
            const y = n - l - 1 - x;
            foreach (r; 0 .. l + 1) {
              if (n * (n - 1) / 2 - b == 0 * x + r + l * y) {
                const scores = [
                    l * (l - 1) / 2 + (n - l) * (n - l - 1) / 2,
                    (l + x) * (l + x - 1) / 2 + (n - l - x) * (n - l - x - 1) / 2
                ];
                if (scores[0] <= scores[1]) {
                  foreach (score; scores) {
                    chmin(mn, score);
                    chmax(mx, score);
                  }
                }
              }
            }
          }
        }
        writefln("  [%d, %d]", mn, mx);
        foreach (a; (n * (n - 1) + 3) / 4 .. b - n + 1) {
          assert(mn <= a && a <= mx);
        }
      }
    }
  }
  
  try {
    for (; ; ) {
      N = readInt();
      A = readInt();
      B = readInt();
      
      foreach (l; 0 .. N + 1) {
        foreach (x; 0 .. (N - l - 1) + 1) {
          const y = N - l - 1 - x;
          int r = N * (N - 1) / 2 - B;
          if (y > 0) {
            r %= y;
          }
          if (0 <= r && r <= l) {
            int s0 = l * (l - 1) / 2 + (N - l) * (N - l - 1) / 2;
            int s1 = (l + x) * (l + x - 1) / 2 + (N - l - x) * (N - l - x - 1) / 2;
            if (s0 <= A && A <= s1) {
              doIt(l, x, y, r, s0, s1, 0);
              goto done;
            }
            /*
            if (s1 <= A && A <= s0) {
              doIt(l, x, y, r, s0, s1, 1);
              goto done;
            }
            */
          }
        }
      }
      assert(false);
     done:
    }
  } catch (EOFException e) {
  }
}