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, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']
[EX A]: 51416

[EX Q]: 2, 2, ['8149', '7123', 'c', 'X', '1659']
[EX A]: 7123

[EX Q]: 1, 14, ['V', '4137', '6909', 'I', 'o', 'q', 'a', '3663', 'b', '3929', '397', '9379', '2123', '6459', '9', '7185', 'p', 'h', 'A', 'D', 'R', 'r', 'e', '821', 'S', '4427']
[EX A]:
36996