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]: 2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']
[EX A]: 12664

[EX Q]: 9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']
[EX A]: 15061

[EX Q]: 8, 17, ['H', '569', 'V', '2187', '5175', '5263', '7067', 'U', '8413', 'B', '3915', '3539', 'j', '8655', 'w', '8285', '4579', '1887', '6475', '5591', 'N', 'j', 'v', 'p']
[EX A]:
37386