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, 17, ['4061', '8041', 'V', '5461', '8247', '3119', 'p', '5313', 'T', 'Z', 'D', '8837', 'B', 'a', '6441', 'O', '8311', 'Z', '473', '9', 'Q', 'E', '2957', 'W', '6263', '3917', '9775', 't']
[EX A]: 57831

[EX Q]: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[EX A]: 1937

[EX Q]: 1, 15, ['J', '563', '4307', '2447', '6953', 'e', '479', '8461', '4475', '7671', 'u', 'R', '4483', '6699', '8925', 's']
[EX A]:
55463