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]: 3, 26, ['5141', 'c', 'c', 'K', '3639', '4487', 'G', '8839', 'F', '6699', '9171', '9409', 'm', 'N', 'E', '6055', '6819', 'c', 'r', 'u', '2475', 'q', 'F', '319', 'g', '2923', 'o', '6315', '8335']
[EX A]: 60835

[EX Q]: 8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']
[EX A]: 0

[EX Q]: 2, 27, ['m', 'X', '929', '5931', '4505', '4193', '5717', 'p', '3377', 'u', 'j', 'u', '8979', '1853', 'Y', '3659', '3487', 'T', 'D', 'l', 'V', 'R', '6375', '5833', 'Q', '1365', '2011', 'A', 'C']
[EX A]:
58214