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]: 6, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']
[EX A]: 28431

[EX Q]: 3, 5, ['i', 'e', '6583', '313', '5511']
[EX A]: 12407

[EX Q]: 4, 6, ['4899', '8151', 'S', '4313', 'G', '6809', 'T', '6811', 'W', '5609', 'e', '1463', '4805', '1259', 'l', 'b', 'F', '3757', '6911', 'a']
[EX A]:
11122