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.

[EX Q]: 1, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']
[EX A]: 32007

[EX Q]: 3, 16, ['T', 'v', '2985', 'F', '8921', 'M', 'F', '4243', 'k', 'x', '435', 'B', '3335', '7613', 'M', '7809', 'q', '4147', 'h', '7523', 'R', '7589', '8795', 'O', 'L', '3371']
[EX A]: 35341

[EX Q]: 2, 6, ['8221', '5205', 'L', '5505', 'F', '5291', '3779', 'M', '7831']
[EX A]:
16001