/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;

constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
constexpr ll mod17 = 1e9+7;
constexpr ll mod19 = 1e9+9;
constexpr ll mod9 = 998244353;
ll mod = mod17;

// Mod int libraries
template<typename T>
T mod_pow(T a, ll x) {
  T res = 1;
  while(x > 0) {
    if (x & 1) res *= a;
    a *= a; x >>= 1;
  }
  return res;
}

// Mint32
unordered_map<ll, ll> minvmap;
ll minv(ll a, ll m) {
  auto k = a; auto p = minvmap[a]; if (p != 0) return p;
  ll b = m, u = 1, v = 0;
  while (b) { ll t = a/b; swap(a -= t*b, b); swap(u -= t*v, v); }
  p = (u%m+m)%m; minvmap[k] = p; return p;
}

struct mint {
  ll x;
  mint():x(0){}
  mint(ll x):x((x%mod+mod)%mod){}
  mint& fix() { x = (x%mod+mod)%mod; return *this;}
  mint operator-() const { return mint(0) - *this;}
  mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
  mint& operator/=(const mint& a){ (x*=minv(a.x, mod))%=mod; return *this; }
  mint operator+(const mint& a)const{ return mint(*this) += a;}
  mint operator-(const mint& a)const{ return mint(*this) -= a;}
  mint operator*(const mint& a)const{ return mint(*this) *= a;}
  mint operator/(const mint& a)const{ return mint(*this) /= a;}
  bool operator<(const mint& a)const{ return x < a.x;}
  bool operator==(const mint& a)const{ return x == a.x;}
};

// Mint64
struct mint64 {
    ull x;
    static ull mod, inv, r2;
    mint64(): x(0){}
    mint64(ull x): x(init(x)) {}
    static ull init(ull x) { return reduce(__uint128_t(x)*r2);}
    static void set_mod(ull m) {
      mod = inv = m;
      for(int i=0; i<5; i++) inv *= 2 - inv*m;
      r2 = -__uint128_t(m)%m;
    }
    static ull reduce(__uint128_t x) {
      ull y = ull(x >> 64) - ull((__uint128_t(ull(x)*inv)*mod)>>64);
      return ll(y) < 0 ? y+mod : y;
    }
    mint64& operator+=(mint64& a) { x+=a.x-mod; if(ll(x)<0) x+=mod; return *this; }
    mint64 operator+(mint64& a) const{ return mint64(*this)+=a; }
    mint64& operator*=(mint64& a) { x=reduce(__uint128_t(x)*a.x); return *this; }
    mint64 operator*(mint64& a) const { return mint64(*this)*=a; }
};

ull mint64::mod, mint64::inv, mint64::r2;

// Verify: https://yukicoder.me/submissions/472580
struct Miller {
    const vector<ull> v = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    bool suspect(ull a, ull s, ull d, ull n) {
      if (mint64::mod != n) mint64::set_mod(n);
      mint64 one = 1, minusone = n-1, ma = a;
      auto x = mod_pow(ma, d);
      if (x.x == one.x) return true;
      for(int r = 0; r < s; r++) {
        if (x.x == minusone.x) return true;
        x = x * x;
      }
      return false;
    }

    // check if n is prime
    bool check(ull n) {
      if (n < 2 || (n > 2 && n % 2 == 0)) return false;
      ull d = n - 1;
      ull s = 0;
      while (!(d & 1)) {
        d >>= 1;
        s++;
      }
      for (auto a: v) {
        if (a >= n) break;
        if (!suspect(a, s, d, n)) return false;
      }
      return true;
    }
};

class combination {
    // factorial
    public: std::vector<mint> fact;
    public: std::vector<mint> inv;

    combination(int n) {
      fact.resize(n + 1);
      inv.resize(n + 1);
      fact[0] = 1;
      for (int i = 1; i <= n; i++) {
        fact[i] = fact[i - 1] * i;
      }
      inv[n] = mint(1) / fact[n];
      for (int i = n - 1; i >= 0; i--) {
        inv[i] = inv[i + 1] * (i + 1);
      }
    }

    // nCr
    public: mint get(int n, int r) {
      if (n < r || n < 0 || r < 0) return 0;
      return fact[n]*inv[r]*inv[n-r];
    }
    // nPr
    public: mint p(int n, int r) {
      if (n < r || n < 0) return 0;
      return fact[n]*inv[n-r];
    }
};

// Segment Tree for query sum[a, b)
template<typename T>
class SegTree {
    using F = function<T(T, T)>;
    int N;
    vector<T> dat;
    const F f;  // merge monoids
    const T ID; // identity

    // RangeSumQuery:
    // auto f = [](ll a, ll b) { return a+b; };
    // auto ID = 0LL;

    // RangeMaximumQuery:
    // auto f = [](ll a, ll b) { return max(a, b); };
    // auto ID = 0LL;
    // (sometimes it should be LLONG_MIN)

    // RangeMinimumQuery:
    // auto f = [](ll a, ll b) { return min(a, b); };
    // auto ID = LLONG_MAX;

    // auto seg = SegTree<ll>(100000, f, ID);
public: SegTree(int n, const F f, const T& ID) : f(f), ID(ID) {
    N = 1;
    while(N < n) N *= 2;
    dat.resize(2*N-1, ID);
  }

public: void build(vector<T>& a) {
    int n = a.size();
    for(int i=0; i<n; i++) dat[i+N-1] = a[i];
    for(int i=N-2; i>=0; i--) dat[i] = f(dat[i*2+1], dat[i*2+2]);
  }

  // update k-th element
public: void update(int k, const T& a) {
    k += N-1;
    dat[k] = a;
    while(k > 0) {
      k = (k-1)/2;
      dat[k] = f(dat[k*2+1], dat[k*2+2]);
    }
  }

  // add k-th element by a
public: void add(int k, const T& a) {
    k += N-1;
    dat[k] = f(dat[k], a);
    while(k > 0) {
      k = (k-1)/2;
      dat[k] = f(dat[k*2+1], dat[k*2+2]);
    }
  }

  // return sum[a, b)
public: T query(int a, int b) {
    return query(a, b, 0, 0, N);
  }
public: T query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return ID;
    if (a <= l && r <= b) return dat[k];
    auto m = (l+r)/2;
    return f(query(a, b, k*2+1, l, m), query(a, b, k*2+2, m, r));
  }
};

class FRobotsAndExits {
public:
    void solve(istream& cin, ostream& cout) {
      SPEED;
      int n, m; cin >> n >> m;
      vector<ll> x(n), y(m);
      rep(i, n) {
        cin >> x[i];
      }
      rep(i, m) {
        cin >> y[i];
      }
      set<P> st;
      set<int> compress;
      rep(i, n) {
        auto idx = distance(y.begin(), lower_bound(all(y), x[i]));
        if (idx == 0 || idx == m) continue;
        st.emplace(x[i]-y[idx-1], y[idx]-x[i]);
        compress.insert(y[idx]-x[i]);
      }

      map<int, int> mp;
      int idx = 1;
      for(auto e: compress) {
        mp[e] = idx;
        idx++;
      }

      // RangeSumQuery
      auto f = [](mint a, mint b) { return a+b; };
      mint ID = 0;
      auto seg = SegTree<mint>(idx, f, ID);
      seg.add(0, 1);
      int beforeL = -1;
      vector<pair<int, mint>> v;
      for(auto e: st) {
        auto k = mp[e.second];
        if (e.first != beforeL) {
          while(!v.empty()) {
            auto p = v.back(); v.pop_back();
            seg.add(p.first, p.second);
          }
        }
        auto left = seg.query(0, k);
        v.emplace_back(k, left);
        beforeL = e.first;
      }

      while(!v.empty()) {
        auto p = v.back(); v.pop_back();
        seg.add(p.first, p.second);
      }

      cout << seg.query(0, idx).x << endl;
    }
};

signed main() {
  FRobotsAndExits solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}

Measured memory_bytes: 18560