#!/usr/bin/perl
$|++;
open IN, "joshWordList.txt";
@words = <IN>;
close IN;
my $re = qr($ARGV[0]);
my $re2 = qr($ARGV[2]);
my $len = $ARGV[1];
my $len2 = $ARGV[3];
my @intersect = split /,/,$ARGV[4];
print "look for $ARGV[0] with length $len\nCROSS $ARGV[2] with length $len2\nAT $ARGV[4]\n";
for (@words) {
    chomp;
    if (/$re/ && length($_) == $len) {
        push @word1,$_;
        print "FOUND WORD 1: $_\n";
    }
    if (/$re2/ && length($_) == $len2) {
        push @word2,$_;
        print "FOUND WORD 2: $_\n";
    }
}
for (@word1,@word2) { print "$_\n" }

for $w1 (@word1) {
    @w = split //,$w1;
    $l1 = $w[$intersect[0]-1];
    for $w2 (@word2) {
        @w2 = split //,$w2;
        $l2 = $w2[$intersect[1]-1];
        print "$w1 and $w2\n" if $l2 eq $l1;
    }
}