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]: 12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']
[EX A]: 22751

[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]: 6, 10, ['3639', '3929', 'w', '8437', 'i', 'S', 'Y', '999', '4657', '6647']
[EX A]:
12303