#?  $HoFlg1=(Query_id=>{$Query_id},Subj_id=>{$Subj_id},bit_score=>{$bit_score},Flag=>$Flag1);
    #?  $HoFlg2=(Query_id=>{$Query_id},Subj_id=>{$Subj_id},bit_score=>{$bit_score},Flag=>$Flag2);
        $HoFlg1->{$Query_id}->{$Subj_id}->{$bit_score}=$Flag1;
        $HoFlg2->{$Query_id}->{$Subj_id}->{$bit_score}=$Flag2;

##</code><code>##

##### For each Query_id find top bit score
sub largest_key {
    my $hash = @_;
    my ($large_key) = each %$hash;

    foreach (my ($key) = keys %$hash) {
        if ($key > $large_key) {
            $large_key = $key;
        }
    }
    return $large_key;
}

##### For each Query_id find top bit score
my %Hotop_bit;
foreach my $key1 (keys %{$HoFlg2}){
        foreach my $key2 (keys %{$HoFlg2->{$key1}}){
                foreach my $key3 (keys %{$HoFlg2->{$key1}->{$key2}}) {
                        $top_bit=&largest_key(%{$HoFlg2->{$key1}->{$key2}})
                        print "key1\t$key1\tkey2$key2\tbitscore\t$key3\n";
                        $Hotop_bit{$key1}=$top_bit; #??probably wrong
                        }
                }
        print "for query\t$key1 top bit score is\t$Hotop_bit{$key1}\n";
        }

###For each Query_id find top bit score - using => hash creation ;
foreach my $key1 (keys %{$HoFlg2}){
        my @bits=map{$HoFlg2{$key1}->{bit_score}} keys(%HoFlg2);
        $top_bit=reverse sort(@bits)[0];
        $Hotop_bit{$key1}=$top_bit;

}
###For each Query_id find top bit score - using => hash creation ;
foreach my $key1 (keys %{$HoFlg2})
        my $highest_bit=( reverse sort { $HoFlg2{$a}->{bit_score} <=> $HoFlg2{$b}->{bit_score}} keys(%HoFlg2) )[0];