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.

Example Input: 1, 3, ['5437', '8521', '9081', 'h', '5453', '5065', '2949', 'P', 'Q', '2853', '7857', 'l', '5217', 'O', 'V', '3585', 't', '2593', 'V']
Example Output: 23039

Example Input: 2, 21, ['7753', '4315', '7527', 'R', 'W', 'a', '3983', 'w', 'F', '8967', 's', 'Y', 'D', 'I', '5305', '2535', 'u', '135', 'M', 'D', 'G', 't', 'r', 'g', 'W', 'V', '3461', 'P', 'T', 'd']
Example Output: 32767

Example Input: 10, 17, ['L', '2359', '7659', 'z', '6867', 'g', 'F', '2339', '6263', 'k', 't', 'Z', 'V', '7055', 'z', '4149', '3961', 'e', 'k']
Example Output:
15165