# Example 3
# This problem has deterministic results for all greedy solver variants.
# Makespan for each variant:
# - SPT: 53
# - LPT: 92
# - SRPT: 78
# - LRPT: 54
# - EST_SPT: 48
# - EST_LPT: 56
# - EST_SRPT: 53
# - EST_LRPT: 56
4 3 # num-jobs num-tasks
0 1 1 2 2 15
1 4 0 5 2 11
0 7 2 8 1 13
2 3 0 18 1 6