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]: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']
[EX A]: 36593

[EX Q]: 6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']
[EX A]: 28446

[EX Q]: 1, 13, ['v', 'm', 'Q', 'I', 'A', 'r', 'G', 'n', '5565', '5697', 'y', '525', 'P', '6675', 'e', '2235']
[EX A]:
11787