Problem:
Score : 900 points

Problem Statement

There are N robots and M exits on a number line.
The N + M coordinates of these are all integers and all distinct.
For each i (1 \leq i \leq N), the coordinate of the i-th robot from the left is x_i.
Also, for each j (1 \leq j \leq M), the coordinate of the j-th exit from the left is y_j.

Snuke can repeatedly perform the following two kinds of operations in any order to move all the robots simultaneously:

Increment the coordinates of all the robots on the number line by 1.

Decrement the coordinates of all the robots on the number line by 1.

Each robot will disappear from the number line when its position coincides with that of an exit, going through that exit.
Snuke will continue performing operations until all the robots disappear.

When all the robots disappear, how many combinations of exits can be used by the robots?
Find the count modulo 10^9 + 7.
Here, two combinations of exits are considered different when there is a robot that used different exits in those two combinations.

Constraints

1 \leq N, M \leq 10^5

1 \leq x_1 < x_2 < ... < x_N \leq 10^9

1 \leq y_1 < y_2 < ... < y_M \leq 10^9

All given coordinates are integers.

All given coordinates are distinct.

Input

Input is given from Standard Input in the following format:

N M
x_1 x_2 ... x_N
y_1 y_2 ... y_M

Output

Print the number of the combinations of exits that can be used by the robots when all the robots disappear, modulo 10^9 + 7.

Sample Input 1

2 2
2 3
1 4

Sample Output 1

3

The i-th robot from the left will be called Robot i, and the j-th exit from the left will be called Exit j.
There are three possible combinations of exits (the exit used by Robot 1, the exit used by Robot 2) as follows:

(Exit 1, Exit 1)

(Exit 1, Exit 2)

(Exit 2, Exit 2)

Sample Input 2

3 4
2 5 10
1 3 7 13

Sample Output 2

8

The exit for each robot can be chosen independently, so there are 2^3 = 8 possible combinations of exits.

Sample Input 3

4 1
1 2 4 5
3

Sample Output 3

1

Every robot uses Exit 1.

Sample Input 4

4 5
2 5 7 11
1 3 6 9 13

Sample Output 4

6

Sample Input 5

10 10
4 13 15 18 19 20 21 22 25 27
1 5 11 12 14 16 23 26 29 30

Sample Output 5

22

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define sc second
#define fi first
#define pii pair <int,int>
#define ll long long
#define lowbit(a) a&-a
using namespace std;

inline int read(){
	int sum=0,f=1;char ch=getchar();
	while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0' && ch<='9'){sum=sum*10+ch-'0';ch=getchar();}
	return f*sum;
}

const int N=100001;
const int Mod=1e9+7;
int n,m,a[N],b[N],d[N],t1,t2;
ll t[N],ans=1;
pair <int,int> c[N];

inline void add(int x,ll k){
	for(int i=x;i<=t2;i+=lowbit(i)) t[i]=(t[i]+k)%Mod;	
}

inline ll ask(int x){
	int ret=0;
	for(int i=x;i;i-=lowbit(i)) ret=(ret+t[i])%Mod;
	return ret;
}

bool cmp(pii a,pii b){return a.fi!=b.fi? a.fi<b.fi:a.sc>b.sc;}

int main(){
	n=read();m=read();
	for(int i=1;i<=n;i++) a[i]=read();
	for(int i=1;i<=m;i++) b[i]=read();
	for(int i=1;i<=n;i++){
		if(a[i]<=b[1]||a[i]>=b[m]) continue;
		int k=lower_bound(b+1,b+m+1,a[i])-b;
		if(a[i]==b[k]) continue;
		c[++t1]=make_pair(a[i]-b[k-1],b[k]-a[i]);d[++t2]=b[k]-a[i];
	}
	sort(d+1,d+t2+1);int l=unique(d+1,d+t2+1)-d-1;
	for(int i=1;i<=t1;i++){
		c[i].second=lower_bound(d+1,d+l+1,c[i].second)-d;
	}
	sort(c+1,c+t1+1,cmp);t1=unique(c+1,c+t1+1)-c-1;
	for(int i=1;i<=t1;i++){
		ll sum=ask(c[i].sc-1)+1;
		ans=ans+sum%Mod;add(c[i].sc,sum);
	}
	printf("%lld\n",ans);
	return 0;
}