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, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']
[EX A]: 6328

[EX Q]: 1, 2, ['t', '9343', 'g']
[EX A]: 9343

[EX Q]: 23, 24, ['6265', 'f', 'x', '7443', 'I', 'E', '3823', '179', 'R', '3667', 'E', '655', '477', 'i', '1151', 't', 'e', '8013', '8747', 'R', '7623', 'h', '8475', '5843', 'p', '6455', 'i']
[EX A]:
14318