现在有两个单调递增序列，第一个序列有N个整数，第二个序列有M个整数，现在你可以从第一个序列中选一个数x，然后从第二个序列中选一个数y，那么有多少种情况满足x+y<=K呢？

输入包含多组数据。



对于每组数据，输出有多少种情况满足x + y <= K。



对于每组数据，输出有多少种情况满足x + y <= K。

-There are two monotonically increasing sequence, a sequence of N integers, the second sequence of M integers, you can now　one　the first sequence number x, then the second sequence selected　a number y, So how many cases meet x+y < = K it? Input contains multiple sets of data. For each set of data, the number of cases to meet output x+ y < = K. For each set of data, the number of cases to meet output x+ y < = K.