#16 Its possible to eliminate all combinations that contain more than a certain number of combinations in any position, but of all the characters?

[Melkor]

Hello,

I have a question regarding the use of crunch, to see if you can solve it.

If I write "crunch 1 25 abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWX
YZ0123456789 " you get all combinations of lowercase, uppercase and numbers, in combinations of 1 to 25 characters.To this end I think it is correct. (Yes, I know the result would be a bunch of information that there are not enough discs in the world for save it is just as an example)

Then, if I add "-d 8 a" for example, from what I said in the previous paragraph, I would eliminate all combinations that had more than 8 a, right?
If so, would this affect only the combinations in which they are followed or also in which they appear separated by other characters and also exceed 8 in total?

The second part of the query is if there is a way to tell crunch to remove from the result all the combinations that contain more than a certain number of combinations in any position, but of all the characters? (In this case abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWX
YZ0123456789)

Thank you all greetings

PS: Translated with GoogleTranslate, sorry