You are given two arrays: nums (containing positive integers) and queries (each containing a target sum).

For each query, return the maximum size of a subsequence from nums whose sum is less than or equal to the query value. ...