import java.io.*;
import java.util.*;

public class bound {
  public static void main(String[] args) { try {
    LineNumberReader Quelle = new LineNumberReader(new FileReader("bound.in"));
    
    while(true) {
      String Zeile = Quelle.readLine();
      if (Zeile==null) return;
      
      StringTokenizer Tokens = new StringTokenizer(Zeile);
      
      int n = Integer.parseInt(Tokens.nextToken());
      
      int k = Integer.parseInt(Tokens.nextToken());
      
      if ((n==0) && (k==0)) return;
      
      int[] values = new int[n];
      
      Zeile = Quelle.readLine();
      Tokens = new StringTokenizer(Zeile);
      
      for (int i=0; i<n; i++) {
      	values[i] = Integer.parseInt(Tokens.nextToken());
        //System.out.print(values[i]+" ");
      }

      //System.out.println();

      Zeile = Quelle.readLine();
      Tokens = new StringTokenizer(Zeile);
     
      int currsum, query, bestabs, bestlower, bestupper, bestdiff, lower, upper, x, qnr, currdiff,
      currabs;
      for (qnr=0; qnr<k; qnr++) {
      	//System.out.println("Query #"+qnr);
      
      	query = Integer.parseInt(Tokens.nextToken());
	
	bestabs = -1;
	bestdiff=Integer.MAX_VALUE;
	bestlower=-1;
	bestupper=-1;
	
	for (lower=0; lower<n; lower++) {
	  for (upper=lower; upper<n; upper++) {
	    currsum=0;
	    for (x=lower; x<=upper; x++) currsum+=values[x];
	    currabs = Math.abs(currsum);
	    currdiff = Math.abs(currabs - query);
	    
	    //System.out.println("l:"+lower+" u:"+upper+" sum:"+currsum+" abs:"+currabs+" diff:" 
	    //+currdiff+" best"+bestdiff);
	    
	    if (currdiff <= bestdiff) {
	      bestdiff = currdiff;
	      bestabs = currabs;
	      bestlower = lower;
	      bestupper = upper;
	    }	    
	  }
	}
	
	System.out.print(bestabs);
	System.out.print(' ');
	System.out.print(bestlower+1);
	System.out.print(' ');
	System.out.println(bestupper+1);	
      }

    }   
  } catch (Exception E) {System.out.println(E);}}
}