def fn(arr, k):
    n=len(arr)
    dp=[[0]*(k+1) for _ in range(n+1)]

    for i in range(1, n + 1):
        for j in range(1, k + 1):
            dp[i][j]=dp[i-1][j]
            items = 1
            while items <=j:
                dp[i][j]=max(dp[i][j],arr[i-1][items-1]+dp[i-1][j-items])
                items+=1

    return dp[n][k]