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, 2, ['R', '979', 'H', 'W', 'y']
[EX A]: 979

[EX Q]: 8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']
[EX A]: 14437

[EX Q]: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']
[EX A]:
12782