Optimize!

给定一个长度为 $n$ 的序列 $A$ 和一个长度为 $len$ 的序列 $B$。求 $A$ 有多少长度为 $len$ 的连续区间和 $B$ 完美匹配。 两个序列完美匹配当且仅当存在一种各自打乱顺序的方案使得两个序列对应位置上的数的和都不小于 $h$。

Manao is solving a problem with the following statement: He came up with a solution that produces the correct answers but is too slow. You are given the pseudocode of his solution, where the function getAnswer calculates the answer to the problem: `<br></br>getAnswer(a[1..n], b[1..len], h)<br></br> answer = 0<br></br> for i = 1 to n-len+1<br></br> answer = answer + f(a[i..i+len-1], b, h, 1)<br></br> return answer<br></br><br></br>f(s[1..len], b[1..len], h, index)<br></br> if index = len+1 then<br></br> return 1<br></br> for i = 1 to len<br></br> if s[index] + b[i] >= h<br></br> mem = b[i]<br></br> b[i] = 0<br></br> res = f(s, b, h, index + 1)<br></br> b[i] = mem<br></br> if res > 0<br></br> return 1<br></br> return 0<br></br>`Your task is to help Manao optimize his algorithm.

The first line contains space-separated integers $ n $ , $ len $ and $ h $ ( $ 1<=len<=n<=150000; 1<=h<=10^{9} $ ). The second line contains $ len $ space-separated integers $ b_{1},b_{2},...,b_{len} $ ( $ 1<=b_{i}<=10^{9} $ ). The third line contains $ n $ space-separated integers $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=10^{9} $ ).

Print a single number — the answer to Manao's problem.

5 2 10
5 3
1 8 5 5 7

2