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, 23, ['N', '8323', '7039', '2941', '8459', '4529', 'I', 'V', 'V', '7929', 'L', 'b', 'x', '6793', '19', '6443', 'i', 'j', 'U', '1183', '2679', 'Q', 'l', 'f', '841']