from collections import defaultdict
import sys 
input = sys.stdin.buffer.readline

def main():
    N,K,P = map(int,input().split())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    B.sort()
    #dica = defaultdict(int)
    #dicb = defaultdict(int)
    #for a,b in zip(A,B):
    #    #dica[a%P] += 1
    #    dicb[b%P] += 1
    #print(dica,dicb)
    #この累積和のメモリが重いわけではなく辞書が重かったぽい。
    bidx = 0
    sb = [0]*(P+1)
    for i in range(P):
        cnt = 0
        while bidx < N and B[bidx] == i:
            bidx += 1
            cnt += 1
            if bidx == N:
                break
        #print(i,cnt)
        sb[i+1] = sb[i] + cnt

    #print(sb)
    #和がx以下となるのがk個以上あるか

    def solve(x):
        ret = 0
        for a in A:
            if a <= x:
                temp = sb[x-a+1] - sb[0]
                temp += sb[P] - sb[P-a]
            else:
                temp = sb[P+x-a+1] - sb[P-a]
            ret += temp
        #print(x,ret)
        return ret

    #test = 9
    #print(solve(test))

    if solve(0) >= K:
        print(0);exit()

    ok = P
    ng = 0 #これは事前にチェック

    while abs(ok-ng) > 1:
        mid = (ok+ng)//2
        #print(mid)
        if solve(mid) >= K:
            ok = mid
        else:
            ng = mid
    #print(solve(2))
    print(ok)

if __name__ == '__main__':
    main()