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, 24, ['2767', '5843', '2707', '2337', '6373', '1267', 'T', 'l', 'N', 'T', 'Z', 'Y', '699', '8411', 'L', '3983', '9083', '4929', '3757', 'R', '2281', '3547', '9079', 'R', '787']
[EX A]: 45769

[EX Q]: 1, 2, ['t', '9343', 'g']
[EX A]: 9343

[EX Q]: 9, 18, ['Z', '9669', 't', 'R', '3785', 'z', '4581', 'r', 'Y', 'a', 'S', 'U', 'c', 'Q', 'k', 'F', 'i', 'P', '5157', '9273', '6071', 'K', '1969', '587', 'R', '5951', 'e', '1947', '6243']
[EX A]:
0