题目描述

Farmer John is continuing to ponder the issue of cows crossing the road through his farm, introduced in the preceding two problems. He realizes now that the threshold for friendliness is a bit more subtle than he previously considered -- breeds $a$ and $b$ are now friendly if $|a - b| \leq K$, and unfriendly otherwise. Given the orderings of fields on either side of the road through FJ's farm, please count the number of unfriendly crossing pairs of breeds, where a crossing pair of breeds is defined as in the preceding problems.

输入格式

The first line of input contains $N$ ($1 \leq N \leq 100,000$) and $K$ ($0 \leq K < N$). The next $N$ lines describe the order, by breed ID, of fields on one side of the road; each breed ID is an integer in the range $1 \ldots N$. The last $N$ lines describe the order, by breed ID, of the fields on the other side of the road. Each breed ID appears exactly once in each ordering.

输出格式

Please output the number of unfriendly crossing pairs of breeds.

题目大意

给出两个排列 $A,B$ ，相等的数之间连线，求数对 $(i,j)$ 的个数。其中 $(i,j)$ 满足：它们所在两个排列间对应的线交叉且 $|i-j|>k$ 。

4 1
4
3
2
1
1
4
2
3

2

提示

In this example, breeds 1 and 4 are unfriendly and crossing, as are breeds 1 and 3.