In this problem you need to write job distribution subsystem for testing submissions. Invokers (simplistically) are components of testing system, which test given submission on single test and give back a verdict. In this problem two verdicts are possible — OK (test passed) or RJ (rejected, test failed). Job distribution subsystem will be named scheduler . You have to implement it. For each problem two parameters are given: number of tests in a problem and time limit for a problem. We will consider that the system works discreetly and one tick equals 10 milliseconds. If some event occupied in time moment not divisible by 10 ms then scheduler will get it in the nearest next tick. After the end of the contest (i.e., a week after its start) the last solution you sent (having positive score) will be chosen to be launched on the final tests. The final tests are confidential and distinct from those that will be used during the competition. The total number of points that will be scored in the final tests will determine the winner of the competition. Specially for this round we implemented feature to submit ZIP-archive with multiple source files. All files should be in root of ZIP-file, no directories are allowed. You can use this feature for: Java 8: main should be in a class Main of default package; GNU C++ 11: exactly one file should contain the entry point main , all files to compile should have extension cpp . You will be receiving submissions and invoker verdicts in interactive mode. Please be sure to use the stream flushing operation after each of your moves to prevent output buffering. For example, you can use " fflush(stdout) " in C or C++, " System.out.flush() " in Java and " flush(output) " in Pascal. The problem is estimated as follows: let a i is a full testing time (including expectations) of the i -th submission, that is time, passed from the moment of receiving the submission until the moment when it is fully tested. Let's find , where n is the nu