use strict;
use Graph::Matching;
use Graph::Matching qw(max_weight_matching);
my @sub = [];
my @list = split(',', $ARGV[0]);
my $n = 0;
my @graph = [];
my $i = 0;
my $j = 0;
for ($i=0; $n<my $graph; $i++)
{
for ($j=0; $j<=2; $j++)
{
$sub$j = $list$n;
$n++;
}
my $graph$i = @sub;
@sub = [];
}