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, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']
[EX A]: 36328

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

[EX Q]: 6, 7, ['2815', '3361', 'A', '4263', '9397', 'N', 'H', '403', '3071', '3389']
[EX A]:
0