Problem Description

Given tasks with dependencies and durations, find minimum time to complete all tasks using k parallel workers. Tasks can only start after their dependencies are completed.

Input Format

First line: n k (tasks, workers). Second line: n task durations. Third line: m (dependencies). Next m lines: dependency pairs.

Output Format

Minimum time to complete all tasks with k parallel workers.

Constraints

• 1 ≤ n ≤ 100

• 1 ≤ k ≤ 10

• 1 ≤ task duration ≤ 100

• 0 ≤ m ≤ n*(n-1)/2

• No circular dependencies

• Tasks numbered 0 to n-1

Sample Input/Output

Explanation

Task dependencies and parallel execution with 2 workers to find minimum completion time.