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]: 2, 3, ['3335', '3451', 'f', 'M']
[EX A]: 3451

[EX Q]: 5, 6, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']
[EX A]: 4409

[EX Q]: 4, 6, ['f', 'Y', 'Q', '2833', '4489', 'z', '1881', 'd', '3745', '139', 'L', '489', '5271']
[EX A]:
7322