def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    
    v1 = 0
    c1 = N
    v1 = int(input[idx+1])
    idx += 2  # skip first line
    
    INF = -10**18
    dp_other = [[INF] * (N + 1) for _ in range(N + 1)]
    dp_other[0][0] = 0
    
    for i in range(2, N + 1):
        c_i = int(input[idx])
        v_i = int(input[idx + 1])
        idx += 2
        
        max_t = min(c_i, N // i)
        if max_t == 0:
            continue
        
        for t in range(1, max_t + 1):
            for m in range(N, t - 1, -1):
                for w in range(N, t * i - 1, -1):
                    prev_m = m - t
                    prev_w = w - t * i
                    if dp_other[prev_m][prev_w] != INF:
                        if dp_other[m][w] < dp_other[prev_m][prev_w] + t * v_i:
                            dp_other[m][w] = dp_other[prev_m][prev_w] + t * v_i
    
    max_prefix = [[INF] * (N + 1) for _ in range(N + 1)]
    for m in range(N + 1):
        current_max = INF
        for w in range(N + 1):
            if dp_other[m][w] > current_max:
                current_max = dp_other[m][w]
            max_prefix[m][w] = current_max
    
    for k in range(1, N + 1):
        ans = k * v1
        max_m = min(k, N - k)
        for m in range(0, max_m + 1):
            W = N - k + m
            if W < 0:
                continue
            if m > N:
                continue
            W = min(W, N)
            current_val = max_prefix[m][W]
            if current_val == INF:
                continue
            current_val += (k - m) * v1
            if current_val > ans:
                ans = current_val
        print(ans)

if __name__ == '__main__':
    main()