import bisect

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    K = int(input[idx])
    idx += 1
    tasks = []
    for _ in range(N):
        T = int(input[idx])
        idx += 1
        D = int(input[idx])
        idx += 1
        tasks.append((T, D))
    
    # Sort tasks by D in descending order
    tasks_sorted_by_d = sorted(tasks, key=lambda x: (-x[1], x[0]))
    
    schedule = []
    scheduled_times = set()
    
    for T, D in tasks_sorted_by_d:
        pos = bisect.bisect_left(schedule, T)
        valid = True
        
        # Check previous
        if pos > 0:
            prev_T = schedule[pos-1]
            if T - prev_T < K:
                valid = False
        
        # Check next
        if pos < len(schedule):
            next_T = schedule[pos]
            if next_T - T < K:
                valid = False
        
        if valid:
            bisect.insort(schedule, T)
            scheduled_times.add(T)
    
    # Collect complement tasks
    max_d = 0
    sum_d = 0
    for T, D in tasks:
        if T not in scheduled_times:
            if D > max_d:
                max_d = D
            sum_d += D
    
    print(max_d)
    print(sum_d)

if __name__ == '__main__':
    main()