Complexity Picker

**Description:** Given the constraint ceiling N and the time limit in seconds, print the intended complexity class. Use the standard budget: ~5*10^7 simple operations per second in this judge. **Input:** One line: N TL (1 <= N <= 10^9, 1 <= TL <= 10). **Output:** One of: exponential (N <= 25), cubic (N^3 fits), quadratic (N^2 fits), linearithmic (N log N fits), linear (otherwise). Print the FIRST class in that order whose cost fits the budget N-tier * cost <= 5*10^7 * TL. **Example:** 100 1 -> cubic (10^6 <= 5*10^7).