ATM Queue Problem (Need Help)!

Hey. I solved this ATM Queue problem from Kickstart Round F in Java. I am getting the right answers in Eclipse but not in Kickstart Ide. Can anybody please suggest where I am going wrong ?

import java.util.*;
public class Solution
{
   public static void main(String[] args)
   {
        Scanner sc =new Scanner(System.in);
       int T=sc.nextInt();//test cases
      nt c=1;
       int k,temp;

       while(T>0)
       {
       	k=0;
       	int N=sc.nextInt();//number of people
           int X=sc.nextInt();//max amount

           int A[]=new int[N];//array of amounts
           int b[]=new int[N];//result array
           int d[]=new int[N];//storing index of elements
        
       //inputting ele in A    
       for(int i=0;i<N;i++)
       {
           A[i]=sc.nextInt();
           d[i]=i;//storing index of elements
       }
       int f=0;
       while(N>0)
       {
           if(A[0]>X)
           {
           	A[0]=A[0]-X;
           	
               for(int j=0;j<N-1;j++)
               {
               temp=A[j];
               A[j]=A[j+1];
               A[j+1]=temp;
               
               temp=d[j];
               d[j]=d[j+1];
               d[j+1]=temp;
               }
              
           }
           else 
           {
           	int y=d[0];
               for(int j=0;j<N-1;j++)
               {
               
               A[j]=A[j+1];d[j]=d[j+1];
               
               }
               b[k]=y+1;
               k++;
               N=N-1;
           }
           
       }
       System.out.print("Case #"+c+": ");
       c++;
       for(int i=0;i<k;i++)
       System.out.print(b[i]+" ");
       T=T-1;
   }
}}

Please Provide Link for the problem

The solution which I mentioned was completed for the sample test case mentioned in the problem, but it is not true for all test cases. Please help me know why ?