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, 3, ['Z', 'X', 't']
[EX A]: 0

[EX Q]: 1, 17, ['4061', '8041', 'V', '5461', '8247', '3119', 'p', '5313', 'T', 'Z', 'D', '8837', 'B', 'a', '6441', 'O', '8311', 'Z', '473', '9', 'Q', 'E', '2957', 'W', '6263', '3917', '9775', 't']
[EX A]: 57831

[EX Q]: 9, 23, ['o', 'N', 'y', 'e', '7091', 'A', '1799', '6463', 'K', '9893', 'E', 'h', '257', '7113', '6833', '2171', 'p', '2693', '8625', 'A', '2457', 'b', 'k']
[EX A]:
40042