B'After a successful year of milk production, Farmer John is rewarding his cows with their favorite treat: tasty grass! On the field, there is a row of n units of grass, each with a sweetness s_i . Farmer John has m cows, each with a favorite sweetness f_i and a hunger value h_i . He would like to pick two disjoint subsets of cows to line up on the left and right side of the grass row. There is no restriction on how many cows must be on either side. The cows will be treated in the following manner: Note that grass does not grow back. Also, to prevent cows from getting upset, not every cow has to feed since FJ can choose a subset of them. Surprisingly, FJ has determined that sleeping cows are the most satisfied. If FJ orders optimally, what is the maximum number of sleeping cows that can result, and how many ways can FJ choose the subset of cows on the left and right side to achieve that maximum number of sleeping cows (modulo 10^9+7 )? The order in which FJ sends the cows does not matter as long as no cows get upset. The first line contains two integers n and m ( 1 <= n <= 5000 , 1 <= m <= 5000 ) -- the number of units of grass and the number of cows. The second line contains n integers s_1, s_2, ldots, s_n ( 1 <= s_i <= n ) -- the sweetness values of the grass. The i -th of the following m lines contains two integers f_i and h_i ( 1 <= f_i, h_i <= n ) -- the favorite sweetness and hunger value of the i -th cow. No two cows have the same hunger and favorite sweetness simultaneously. Output two integers -- the maximum number of sleeping cows that can result and the number of ways modulo 10^9+7 . In the first example, FJ can line up the cows as follows to achieve 2 sleeping cows: In the second example, FJ can line up the cows as follows to achieve 1 sleeping cow: In the third example, FJ can line up the cows as foll'...