Silly question #2 - mask question

[Technodude_UK]

Thank you to everyone that has helped up to now.  I'm learning loads and making great progress.

Next question:

I would like to use a mixture of techniques but not quite sure how best to do so...

I know the first word of my password.  I then know it is followed by a 4 digit number combination but after that could be anything, albeit likely to be a bunch of uppercase letters.

I've made a custom mask for the possible numbers and everything works... I just want to reduce the number combinations further.

So far I have:    
Custom charset 1 = 123456

My mask is:
KnownWord?1?1?1?1?u?u?u?u?u?u?u     

I'm using increment to expand past the mask (assuming it continues copying the last ?u and looks for more uppercase letters??  Not sure if this is the case?

Here comes the question:
What if I know the 4 digit number is either 1234 or 3456.  Can I put a wordlist in the middle of my mask to find the numbers rather than running all combinations of 6 numbers individually?

Thanks in advance

[penguinkeeper]

Not really but you can just have 2 separate commands with 1234 and 3456 separately, or use a mask file and do it in a single command but seems unnecessary. You may also get more speed by declaring "KnownWord1234" as a salt, if it's possible in your algorithm (Like with MD5, you'd use -m 20 to prepend the salt to the plain), then just using "?u?u?u....." as your mask, it's a cheeky trick but can get hundreds or thousands of times better speeds

[Technodude_UK]

Good shout. I've broken it down a bit now and will do separate runs. Thank you :-)