#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
#define F first
#define S second
#define ALL(a) a.begin(),a.end()
#define mp make_pair
#define pb push_back
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORN(i,a,b) for(int i=a;i<=b;i++)
#define FORB(i,a,b) for(int i=a;i>=b;i--)
#define INT_MAXI 2147483647
#define INT_MINI -2147483648
#define REV(a) reverse(a.begin(),a.end())
#define NP(a) next_permutation(a.begin(),a.end())
 
typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef vector<int> vi;
typedef vector<ll> vl;


int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll s,p; cin>>s>>p;
    for(ll i=1;i*i<=p;i++){
        ll temp=p/i;
        if(temp+i==s){
            cout<<"Yes\n";
            return 0;
        }
    }
    cout<<"No\n";
    return 0;
}
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fr(i,j,k) for(i = j; i < (k); i++)
#define all(x) x.begin(), x.end()
#define el '\n'
#define remax(a,b) a = max(a, b)
#define remin(a,b) a = min(a, b)
#define sz(x) int32_t(x.size())

typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpi;
// --------------------------------------------------------------------

const pii dxy[] = { {-1, 0}, {1, 0}, {0, 1}, {0, -1} };
const int mod = 1e9 + 7;
const int INF = 2e18;
const ld EPS = 1e-9;
const int NN = 1e5 + 2;

string to_string(string s) {
      return '"' + s + '"';
}
string to_string(const char* s) {
      return to_string((string) s);
}
string to_string(bool b) {
      return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
      return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
      bool first = true;  string res = "{";
      for (const auto &x : v) {
            if (!first) { res += ", "; }
            first = false; res += to_string(x);
      }
      res += "}";	  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
      cerr << " " << to_string(H);
      debug_out(T...);
}

// #define TRACE

#ifdef TRACE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
//============================================================================

void solve() {
      int i = 0, j = 0, k = 0, n = 0, m = 0; 
      cin>>n>>m;
      vi a(n), ops(m);
      fr(i, 0, n) cin >> a[i];
      fr(i, 0, m) cin >> ops[i];

      sort(all(a));
      vi fwd(n, -INF); vi rev(n, -INF);
      for(i = 1; i<n; i += 2){
            fwd[i] = a[i]-a[i-1];
            if(i>1) fwd[i] += fwd[i - 2];
      }

      for(i = n-2; i >= 0; i -= 2) {
            rev[i] = a[i+1]-a[i];
            if(i<n-2) rev[i] += rev[i + 2];
      }
      debug(fwd);
      debug(rev);

      int ans = INF;
      fr(j, 0, m) {
            i = upper_bound(all(a), ops[j]) - a.begin();
            // insert ops at i-1
            if(i % 2 == 0) {
                  int t = i > 0 ? fwd[i - 1] : 0;
                  int g = a[i]-ops[j] + (i < n-1 ? rev[i+1] : 0);
                  g += t;
                  remin(ans, g); 
                              debug(ans, i, ops[j]);

            }
            else {
                  int t = i > 1 ? fwd[i-2] : 0;
                  int g = abs(ops[j] - a[i-1]) + (i < n ? rev[i] : 0);
                  g += t;
                  remin(ans, g);                   
                              debug(ans, i, ops[j]);
            }
      }
      cout << ans << el;
}

int32_t main() {
      ios::sync_with_stdio(false); cin.tie(0); 
      int T = 1; 
      // cin >> T;
      for(int tc = 1; tc <= T; tc++) {
            solve();
       }
      return 0;
}