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, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']
[EX A]: 37543

[EX Q]: 8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']
[EX A]: 47509

[EX Q]: 7, 14, ['6051', '7161', 'j', 'V', '2837', 'd', '4841', 'T', '3377', '4861', 'X', 'j', 'Z', '5771', 'N', 'g', '6937', 'q', '625', 'v']
[EX A]:
18850