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.

1, 6, ['B', 'N', 'b', '9383', '4711', 'K']
14094

16, 18, ['o', '3669', 'M', 'M', 'R', 'r', 'o', 'P', 'q', '9939', '1807', 'F', 'J', 'a', '7773', 'I', 'A', '475', 'W', 'E', '417']
475

8, 15, ['6759', '5985', '459', 'V', '7847', 'v', 'w', '3271', '6859', 'b', '2585', '47', 'H', 'V', 'l', 'f']

12762