## PERL ##########
use warnings;
use strict;
my @input = qw/ 2 3 5 /;
my $target = 10;

my @test = &find( 0, [], [], $target, @input );

foreach my $test (@test) {
	print "@{$test}\n";
}

sub find
  {
  my ($sum, $sofar, $output, $want, @numbers ) = @_;
#	print "$sum //// @{$sofar} /// @numbers\n";
  if( $sum == $want )
    {
   # print "@{$sofar}\n";
	push @{$output},$sofar;
    }
  elsif( $sum < $want and @numbers and $numbers[0] > 0 )
    {
    find( $sum + $numbers[0], [ @{$sofar}, $numbers[0] ], $output, $want, @numbers );
    find( $sum, $sofar, $output, $want, @numbers[1..$#numbers] );
    }
	return @{$output};
  }
############# TCL

proc combinationSum {sum sofar want numbers output } {
	if { $sum == $want } {
		#puts $sofar
		lappend output $sofar
						 }
	if { ( $sum < $want ) && ( [lindex $numbers 0] > 0 ) && ( [llength $numbers] > 0 ) } {
		combinationSum [expr $sum + [lindex $numbers 0]] [concat $sofar [lindex $numbers 0]] $want $numbers $output
		combinationSum $sum $sofar $want [lrange $numbers 1 end] $output
																						}
		return $output
}

set test_input [list 2 3 5 ]
set test_target 10
set test_output  [combinationSum 0 [] $test_target $test_input []]