import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		int[][] A = new int[N][M];
		int[]   b = new int[M];
		for(int i = 0; i < N; i++) {
			for(int j = 0; j< M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		for(int i = 0; i < M; i++) {
			b[i] = sc.nextInt();
		}
		int[] c = multiMV(A, b);
		for(int i = 0; i < c.length; i++) {
			System.out.println(c[i]);
		}
		sc.close();
	}

	// 行列とベクトルの掛け算
	public static int[] multiMV(int[][] A, int[] b) {
		int[] c = new int[A.length];
		for(int i = 0; i < A.length; i++) {
			int e = 0;
			for(int j = 0; j < A[i].length; j++) {
				e += A[i][j] * b[j];
			}
			c[i] = e;
		}
		return c;
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz