In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
16, 17, ['U', '9977', 'L', '7689', '9409', 'f', 'Z', 'E', 'v', '4821', '2935', '7913', '7791', 'h', 'm', '3257', '4845', '3321', 'j', '463', 'z', 'Q', 'k', '9381', 'x', 'O', 'N']