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]: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']
[EX A]: 14716

[EX Q]: 1, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']
[EX A]: 12577

[EX Q]: 4, 4, ['i', 'W', 'X', '3321', 'J', '5223', '1177', '5929', '5281']
[EX A]:
3321