Codeforces Round #577 (Div. 2) A. Important Exam

A. Important Exam

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A class of students wrote a multiple-choice test.

There are nn students in the class. The test had mm questions, each of them had 55 possible answers (A, B, C, D or E). There is exactly one correct answer for each question. The correct answer for question ii worth aiai points. Incorrect answers are graded with zero points.

The students remember what answers they gave on the exam, but they don't know what are the correct answers. They are very optimistic, so they want to know what is the maximum possible total score of all students in the class.

Input

The first line contains integers nn and mm (1≤n,m≤10001≤n,m≤1000) — the number of students in the class and the number of questions in the test.

Each of the next nn lines contains string sisi (|si|=m|si|=m), describing an answer of the ii-th student. The jj-th character represents the student answer (A, B, C, D or E) on the jj-th question.

The last line contains mm integers a1,a2,…,ama1,a2,…,am (1≤ai≤10001≤ai≤1000) — the number of points for the correct answer for every question.

Output

Print a single integer — the maximum possible total score of the class.

Examples

input

Copy

2 4
ABCD
ABCE
1 2 3 4

output

Copy

16

input

Copy

3 3
ABC
BCD
CDE
5 4 12

output

Copy

21

Note

In the first example, one of the most optimal test answers is "ABCD", this way the total number of points will be 1616.

In the second example, one of the most optimal test answers is "CCC", this way each question will be answered by exactly one student and the total number of points is 5+4+12=215+4+12=21.

题意：给出n,m要求学生给出m个回答，只有 ABCDE选项，接下来n行给出学生们的答案和每个答案的权值，求每个问题可能答对的人数乘上权值的大小。

思路：统计各个问题的最大值，最后扫描一遍输出。

#include<bits/stdc++.h>
  using namespace std;
  typedef long long ll;
     int main()
     {
         int n , m;
 
             int ans[1100] = {0};
             int a[1100][30] = { 0 };
             ll solve = 0;
            cin >> n >> m;
            getchar();
          for(int i = 0 ; i < n ; ++ i)
          {
            char doll;
             for(int j = 0 ; j < m ; ++ j)
                doll = getchar(),
                  ++a[j][doll-'A'+1],
                    ans[j] = max(ans[j],a[j][doll-'A'+1]);
                getchar();
          }
          for(int i = 0 ; i < m ; ++ i)
              {
                  int p;
                    scanf("%d",&p);
                       solve += p * ans[i];
              }
          cout << solve << endl;
     }