import java.util.Scanner;

class Main {
  private static final int mod = 2019;
  private static void solve(long l, long r) {
    if (r - l >= 2018) {
      System.out.println(0);
      return;
    }
    Long min = null;
    for (long i = l; i <= r; i++) {
      for (long j = i + 1; j <= r; j++) {
        long m = (i * j) % mod;
        if (min == null || min > m) min = m;
      }
    }
    System.out.println(min);
  }
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    long l = sc.nextLong();
    long r = sc.nextLong();
    solve(l, r);
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz