Terribly help needed pls.......

Question

Hi
I have problem in implementing this banker's algorithm
Resource- Request algorithm
1.If Request <= Need[i][j] go to step2.
else raise ERROR condition process exceeded its maximum claim.
2.If Request[i]<= Available, go to step 3.
else Pi must wait since resources are not available.
3. Available := Available - Request[i];
Allocation += Request[i];
Need[i] -= Request[i];
If the resulting resource-allocation state is safe, the transaction is completed and process Pi is allocated resources. However if the new state is unsafe, then Pi must wait for Request[i] and the old resource-allocation state is restored.
Safety Algorithm:
1. Initalize Work := Availabe and Finish[i]:=false for i=1,2,....p
2.Find an i such that both a.) Finish[i] ==false b) Need[i] <= Work
If such i exists, go to step 4.
3. Work := Work + Allocation[i]
Finish[i] := true
go to step2
4 if Finish[i] == true for all i, then the system is in a safe state
My code is as follows --->
inal int r = 3, p = 5;
         int[][] need = new int[p][r];
         int[][] work = new int[1][r];
         boolean[] finish = new boolean[p];
         System.out.println( "Allocation");
         System.out.println( "----------\n ");
         int[][] allocation = {{0, 1, 0}, {3, 0, 2}, {3, 0, 2},{2, 1, 1},{0, 0, 2}};
         System.out.println( "Max");
         System.out.println( "----\n ");
          int[][] max = {{7, 5, 3},{3, 2, 2},{9, 0, 2},{2, 2, 2},{4, 3, 3}};
         System.out.println( "Available");
     System.out.println( "---------\n ");
     int[][] available = {{2, 3, 0}};
// initializing Work = Availabe
    System.arraycopy(available, 0, work, 0, available.length);
    System.out.println( "Need");
    System.out.println( "----\n ");
       for(int i = 0; i < allocation.length; i++){
          for(int j = 0; j < allocation.length; j++){
need[i][j] = max[i][j] - allocation[i][j];
System.out.println( "Request");
System.out.println( "-------\n ");
int[][] request = {{3, 3, 0}};
System.out.println( "Finish");
System.out.println( "-------\n ");
for(int i =0; i<p; i++){
     finish[i] = false;
// Resource Request Algorithm starts here
for(int i=0; i < request.length;i++){
     for(int j=0; j <request[i].length; j++){
if(request[0][j] > need[3][j]){
System.out.println(" Process has exceeded its maximum claim. ");
}//end if
else if(request[0][j] > available[0][j])
System.out.println("P"+i+" process must wait since the resources are not available.");
else{
available[0][j] = available[0][j] - request[0][j];
allocation[i][j] = available[0][j] + request[0][j];
need[i][j] = need[i][j] - request[0][j];
}//end else
// Safety Algorithm starts here
step2:
for(int m=0; m <= i; m++){
for(int n=0; n <= m; n++){
if(!(finish[i] == false && need[3][j] <= work[0][j])){
     finish[i] = true;
     System.out.println("The system is in safe state when process P3 request "
               + request[0][j] +" from resource "+ need[3][j]);
}//end if
else{
     work[0][j] = work[0][j] + allocation[i][j];
finish[i] = true;
continue step2;
}// end else
} // end j for loop
}// end i for loop

Answer 1

i'm getting wrong output.
when request exceed maximum its not in safe state.
But my code is printing its in safe stateHow about using a debugger or System.out.printlns to verify the internal values that led to this output?