import bisect

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    n = int(data[idx])
    idx += 1
    k = int(data[idx])
    idx += 1
    p = int(data[idx])
    idx += 1
    A = list(map(int, data[idx:idx+n]))
    idx += n
    B = list(map(int, data[idx:idx+n]))
    idx += n
    B.sort()
    
    low = 0
    high = p - 1
    
    while low < high:
        mid = (low + high) // 2
        total = 0
        for a in A:
            if mid >= a:
                part1 = bisect.bisect_right(B, mid - a)
                part2 = len(B) - bisect.bisect_left(B, p - a)
                total += part1 + part2
            else:
                lower = p - a
                upper = mid + (p - a)
                left = bisect.bisect_left(B, lower)
                right = bisect.bisect_right(B, upper)
                total += right - left
            if total >= k:
                break  # Early exit if possible
        if total >= k:
            high = mid
        else:
            low = mid + 1
    print(low)

if __name__ == "__main__":
    main()