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]: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
[EX A]: 4866

[EX Q]: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
[EX A]: 203

[EX Q]: 5, 22, ['I', '5365', 'A', '9215', '7945', '9471', '287', 'r', '8603', 'l', 'T', 'E', 'A', '8279', 'F', 'M', 'h', '4615', '7473', 'u', 'g', 'k', 'P', 'A', '9593']
[EX A]:
46673