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]: 8, 30, ['5585', '6253', '4067', '2991', '1809', 'y', '8803', 'e', 'T', '695', 'b', '8257', '6427', 'm', '2647', '2207', '3241', '3379', 'L', 'B', 'X', 'R', 'v', 'P', '3989', 'n', 'U', '6143', 'N', 'Y']
[EX A]: 36985

[EX Q]: 1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']
[EX A]: 36328

[EX Q]: 8, 10, ['9997', '7059', '4805', '3601', '7365', '4757', 'c', 'e', '2823', '2615']
[EX A]:
5438