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.

[Q]: 16, 17, ['5985', '1925', 'r', 'H', 'p', 'L', '5019', 'y', 'O', '6575', '9729', 'S', '2497', '43', 'u', '317', 'p', '3043', '3247', 'z', 'O', '8379', '7715', '8399']
[A]: 317


[Q]: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
[A]: 9392


[Q]: 5, 30, ['1977', 'Q', '6851', '3461', 'W', 'E', '7975', 'V', '8199', '655', 'P', '1641', 'R', '2857', 'S', '5877', 'Z', 'A', 'z', '4111', '2159', 'V', 'A', '1209', 'c', '2025', '9715', 'I', 'Z', 'o']
[A]:
46423