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]: 3, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']
[EX A]: 10235

[EX Q]: 1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']
[EX A]: 0

[EX Q]: 8, 22, ['4199', 'r', '2619', '3857', '5593', '1775', 'X', '8127', 'f', '8547', '3057', '7781', '2351', 'o', '2911', 'r', 'G', 'N', '767', '9747', '9863', 'W', 'j', 'Q', '927', '575', 'o', '7491', 'j', 'A']
[EX A]:
53151