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: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']
Example Output: 0

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: 1, 4, ['Z', 'a', 'H', 'D', '4713', '9659', '6307', 'y', '4849', '53', 't', 'f', 'Z', '7105', '7733', 'F', 'Y', 'Z', 'l', 'A', '4287', '3371', '5623', 'f', '9171', 'b']
Example Output:
0