cool

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.util.Stack;

public class Queueeueue {

	public static void main(String[] args) {
		Queue<Integer> q = new LinkedList<>();

		ArrayList<Bus> busArmy = new ArrayList<Bus>();

		for(int i = 1; i < rand(100, 250); i ++){
			q.add(i);
		}

		while(q.size() > 0){
			Bus b;
			if(q.size() <= 20){
			b = generateBus(1);
			}else if(q.size() <= 30){
			b = generateBus(2);
			}else{
			b = generateBus(3);
			}
			while(b.isFull() == false && q.size() > 0){
				b.addToBus(q.remove());
			}
			busArmy.add(b);
		}

		for(Bus b: busArmy){
			int[] arr = b.getArr();
			System.out.println("bus capacity: " + b.getCapacity());
			for( int i = 0; i < arr.length; i ++){
				System.out.println(arr[i]);
			}
		}
	}

	private static Bus generateBus(int max){
		int x = rand(1,max);
		switch(x){
		case 1:
			return new Bus(20);
		case 2:
			return new Bus(30);
		case 3:
			return new Bus(40);
		default:
			return null;
		}
	}

	private static int rand(int min, int max) {

		if (min > max) {
			throw new IllegalArgumentException("max must be greater than min");
		}

		Random r = new Random();
		return r.nextInt((max - min) + 1) + min;
	}

}