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]: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
[EX A]: 10058

[EX Q]: 11, 27, ['1573', '6065', '869', '77', '9665', 'o', '8359', 'g', '3557', '521', '6797', '5117', '3921', '5707', 'k', '9855', '8415', 'Y', 'l', 'S', '385', '9063', '8975', '2047', 'H', 'p', 'p']
[EX A]: 60282

[EX Q]: 4, 13, ['6251', 'I', 'H', 'p', 'p', '2715', 'p', 'e', '6245', 'Q', 's', 'A', 'e', '1523', '8653', '1175', 'g', '9343', 'n', '3759', '7319', 'P', 'p', 'U', 'b', '2249', '6719', 'N', 'K', 'O']
[EX A]:
8960