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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']
[EX A]: 1351

[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]: 8, 12, ['v', '5805', 'e', 'v', '789', 'g', 'D', '8999', '9487', 'T', 'w', 'o', 'k', '3833', '3191', '6755', '5443', 'k', 't', 'O', 'a', '2673', 'C']
[EX A]:
18486