Problem:
 Score : 200 points    Problem Statement There are N pieces of source code. The characteristics of the i -th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM} .  Additionally, you are given integers B_1, B_2, ..., B_M and C .  The i -th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0 .  Among the N codes, find the number of codes that correctly solve this problem.      Constraints  All values in input are integers.  1 \leq N, M \leq 20  -100 \leq A_{ij} \leq 100  -100 \leq B_i \leq 100  -100 \leq C \leq 100         Input Input is given from Standard Input in the following format:  N  M  C  B_1  B_2  ...  B_M  A_{11}  A_{12}  ...  A_{1M}  A_{21}  A_{22}  ...  A_{2M}  \vdots  A_{N1}  A_{N2}  ...  A_{NM}       Output Print the number of codes among the given N codes that correctly solve this problem.        Sample Input 1 2 3 -10
1 2 3
3 2 1
1 2 2      Sample Output 1 1  Only the second code correctly solves this problem, as follows:   Since 3 \times 1 + 2 \times 2 + 1 \times 3 + (-10) = 0 \leq 0 , the first code does not solve this problem.  1 \times 1 + 2 \times 2 + 2 \times 3 + (-10) = 1 > 0 , the second code solves this problem.        Sample Input 2 5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13      Sample Output 2 2       Sample Input 3 3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100      Sample Output 3 0  All of them are Wrong Answer . Except yours.

Solution (Python):
def main():
    N, M, C = map(int, input().split())
    A = []
    res = 0
    B = list(map(int, input().split()))
    for _ in range(N):
        result = C
        for i, a in enumerate(list(map(int, input().split()))):
            result += a * B[i]
        if result > 0:
            res += 1
    print(res)
    

main()

Solution (Python):
n,m,c=map(int,input().split())
b=[int(i) for i in input().split()]
a=[]
for i in range(n):
    a.append([int(i) for i in input().split()])




s=[]
for i in range(n):
    s.append(0)
    for j in range(m):
        s[i]+=a[i][j]*b[j]
        
    s[i]+=c


count=0
for i in s:
    if i>0:
        count+=1
print(count)

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
c=0
for _ in range(N):
    A=map(int,input().split())
    AB=[a*b for a,b in zip(A,B)]
    if sum(AB)+C>0:c+=1
print(c)

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
for _ in range(n):
    a = list(map(int, input().split()))
    total = 0
    for i,j in zip(b,a):
        total += i*j
    total += c
    if total > 0:ans+=1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(x) for x in input().split()]
ans = 0
for i in range(N):
    A = [int(x) for x in input().split()]
    c = sum([x*y for x, y in zip(A, B)]) + C
    if c > 0:
        ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for _ in range(N):
    A = list(map(int, input().split()))
    score = C
    for (ai, bi) in zip(A, B):
        score += ai * bi
    if score > 0:
        ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for i in range(N):
    calc = C
    A = list(map(int, input().split()))
    for j in range(M):
        calc += A[j] * B[j]
    if calc > 0:
        ans += 1
print(ans)

Solution (Python):

def main():
    a, b, c = map(int, input().split())
    array = list(map(int, input().split()))
    
    
    multi_list = [list(map(int, input().split())) for _ in range(a)]

    cnt = 0

    for i in range(a):
        sum = 0
        for j in range(b):
            sum += multi_list[i][j] * array[j]
        if sum + c > 0:
            cnt += 1


    print(cnt)


if __name__ == "__main__":
    main()

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

n, m, c = MAP()
b = LIST()
ans = 0
for _ in range(n):
    a = LIST()
    tmp = c
    for i in range(m):
        tmp += a[i] * b[i]
    if tmp > 0:
        ans += 1
print(ans)

Solution (Python):
import numpy as np

n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]

ans = 0
for i in range(n):
    res = 0
    for j in range(m):
        res += a[i][j] * b[j]
    if res + c > 0:
        ans += 1

print(ans)

Solution (Python):
import numpy as np
n,m,c = map(int,input().split())
count = 0
t = np.zeros(n,dtype=int)
b = list(map(int,input().split()))
for i in range(n):
    a = list(map(int,input().split()))
    for j in range(m):
        t[i]+=a[j]*b[j]
    if t[i] + c > 0:
        count+=1
print(count)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
for i in range(n):
    calc = c
    a = list(map(int, input().split()))
    for j in range(m):
        calc += a[j] * b[j]
    if calc > 0:
        ans += 1
print(ans)

Solution (Python):

import os
from sys import stdin







def main():
    input_line = stdin.readline().rstrip().split(' ')
    N, M, C = map(int, input_line)
    B = list(map(int,stdin.readline().rstrip().split(' ')))
    A = [list(map(int,stdin.readline().rstrip().split(' '))) for _ in range(N)]
    ans = 0
    for i in range(N):
        a = sum([A[i][j]*B[j] for j in range(M)])
        a += C
        if(a>0):
            ans+=1

    
    
    
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
count = C
ans = 0
for _ in range(N):
    A = list(map(int, input().split()))
    for i in range(M):
        count += A[i] * B[i]
    if count > 0:
        ans += 1
    count = C
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
list_A = list(map(int, input().split()))
list_B = [ list(map(int,input().split(" "))) for i in range(n)]

ans = 0

for i in range(n):
    l = list_B[i]
    k = c
    for j in range(m):
        k += list_A[j]*l[j]
    if k > 0:
        ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(N):
  sum = 0
  A = list(map(int,input().split()))
  for i in range(M):
    sum += A[i]*B[i]
  sum += C
  if sum > 0:
    ans += 1
print(ans)

Solution (Python):
N,M,C = map(int, input().split(" "))
B = [int(i) for i in input().split(" ")]
count = 0
for i in range(N):
    A = [int(k) for k in input().split(" ")]
    Sum = 0
    for j in range(M):
        Sum += A[j]*B[j]
    if Sum+C>0:
        count+=1
print(count)

Solution (Python):
a,b,c = map(int, input().split())
listed = list(map(int, input().split()))
cnt = 0
for i in range(a):
    lister=list(map(int, input().split()))
    combined1 = [x * y for (x, y) in zip(listed, lister)]
    if sum(combined1)+c>0:cnt += 1
print(cnt)

Solution (Python):
N,M,C = map(int,(input().split()))
B = list(map(int,(input().split())))
A = [0]*N
ans = 0
for i in range(N):
    A[i] = list(map(int,(input().split())))
for i in range(N):
    s = 0
    for j in range(M):
        s += A[i][j] * B[j]
    if s + C > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c= map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
ans = 0
for i in range(n):
         judge = 0
         for j in range(m):
                  judge += a[i][j] * b[j]
         if judge + c > 0:
                  ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
sum = 0
t = 0
for i in range(n):
  a = list(map(int,input().split()))
 
  for x in range(m):
    t += a[x]*b[x]
  
  if t+c >0:
    sum += 1
  t =0
print(sum)

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))

count=0

for i in range(N):
    A=list(map(int,input().split()))
    sum=0
    for m in range(M):
        sum+=A[m]*B[m]
    sum+=C
    if sum>0:
        count+=1

print(count)

Solution (Python):
n,m,c = map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
count=0
t=c
for i in range(n):
    for j in range(m):
        t += a[i][j]*b[j]
    if t > 0:
        count += 1
    t=c

print(count)

Solution (Python):
a=tuple(map(int,input().split()))
b=[]
for i in range(a[0]+1):
    b.append(list(map(int,input().split())))
ans=0
s=0
for j in range(a[0]+1)[1:a[0]+1]:
    for k in range(a[1]):
        s+=b[j][k]*b[0][k]
    s+=a[2]
    if s>0:
        ans+=1
    s=0
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))

count = 0
for i in range(N):
    A = list(map(int, input().split()))
    summention = sum(a*b for a, b in zip(A, B))
    if summention + C > 0:
        count += 1
print(count)

Solution (Python):
n,m,c=list(map(int,input().split()))
b=list(map(int,input().split()))
a=[]
for i in range(n):
    a1=list(map(int,input().split()))
    a.append(a1)

sum=0
for i in range(n):
    t=0
    for j in range(m):
       t+=a[i][j]*b[j]
    t+=c
    if t>0:
        sum+=1
print(sum)

Solution (Python):
import numpy as np


def main():
    n, m, c = map(int, input().split())
    B = list(map(int, input().split()))
    As = [list(map(int, input().split())) for _ in range(n)]

    B_arr = np.array(B)
    ans = 0
    for A in As:
        A_arr = np.array(A)
        judge = np.sum((B_arr*A_arr)) + c
        if judge > 0:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import numpy as np

n, m, c = map(int, input().split())
b = np.array(input().split(), dtype=np.int32)
a = np.array([input().split() for _ in range(n)], dtype=np.int32)

wk = (a*b).sum(axis=1)+c
ans = len([p for p in wk if p > 0])
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list((int(x) for x in input().split())) for _ in range(n)]

cnt = 0
for i in range(n):
    wk = sum([ai*bi for ai, bi in zip(a[i], b)]) + c
    if wk > 0:
        cnt += 1
ans = cnt
print(ans)

Solution (Python):
ans = 0
N, M, C = map(int,input().split())
B = list(map(int, input().split()))
for i in range(N):
  a = list(map(int, input().split()))
  curr = C
  for i in range(M):
    curr += B[i] * a[i]
  if curr > 0:
    ans += 1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
p = 0
for i in range(N):
    ans = 0
    ans += C
    A = list(map(int,input().split()))
    for j in range(M):
        ans += (A[j]*B[j])
    if ans>0:
        p += 1
print(p)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

ans = 0
for i in range(n):
  s = sum([a[i][j]*b[j] for j in range(m)])
  if s+c > 0:
    ans += 1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B = [int(i) for i in input().split()]
A = [[int(i) for i in input().split()] for _ in range(N)]

ans = 0
for i in range(N):
    cnt = 0
    for a,b in zip(A[i], B):
        cnt += a*b
    if cnt + C > 0:
        ans += 1

print(ans)

Solution (Python):

n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

ans = 0

for i in range(n):
    sum = 0
    for j in range(m):
        sum += a[i][j] * b[j]
    
    if sum + c > 0:
        ans += 1
    
print(ans)

Solution (Python):
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

cnt=0
for i in range(N):
    sum=C
    for j in range(M):
        sum+=A[i][j]*B[j]
    if sum>0:
        cnt+=1
print(cnt)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
c = 0
for i in range(N):
  A = list(map(int, input().split()))
  prod = C
  for j in range(M):
    prod += A[j]*B[j]
  if prod>0:
    c += 1
print(c)

Solution (Python):
import numpy as np
n, m, c = map(int, input().split())
b = np.array(list(map(int, input().split())))

cnt = 0
for i in range(n):
    a = np.array(list(map(int, input().split())))
    if np.dot(a, b) + c > 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
ls1 = list(map(int,input().split()))
ls2 = [list(map(int,input().split())) for i in range(n)]
ls = []
for i in range(n):
    a = 0
    for j in range(m):
        a += ls2[i][j]*ls1[j]
    a += c
    if a > 0:
        ls.append(1)
print(len(ls))

Solution (Python):
n, m ,c  = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i in a:
    s = 0
    for j in range(m):
        s += i[j]*b[j]
    s += c
    if s > 0:
        ans += 1
print(ans)

Solution (Python):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N, M, C = list(map(int, sys.stdin.readline().split()))
    B = list(map(int, sys.stdin.readline().split()))
    A = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]

    ret = 0
    for n in range(N):
        k = C
        for m in range(M):
            k += A[n][m] * B[m]

        if k > 0:
            ret += 1

    print(ret)


if __name__ == '__main__':
    main()

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split()))for _ in range(n)]
ans=0
for i in range(n):
  x=c
  for j in range(m):
    x+=a[i][j]*b[j]
  if x>0:ans+=1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
res = 0
for i in range(n):
    a = list(map(int,input().split()))
    cnt = c
    for i, j in zip(a, b):
        cnt += i * j
    res += cnt > 0
print(res)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int, input().split()))
u=0
for i in range(n):
    inp=list(map(int,input().split()))
    s=0
    for j in range(m):
        s+=inp[j]*(b[j])
    s+=c
    if s>0:
        u+=1
print(u)

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(N):
    A=list(map(int,input().split()))
    p=C
    for j in range(M):p+=A[j]*B[j]
    if p>0:count+=1
print(count)

Solution (Python):

n,m,c = map(int,input().split())
b=list(map(int,input().split()))
ans=0
for i in range(n):
    ai = list(map(int,input().split()))
    ans += sum(ai[j] * b[j] for j in range(m))+c >0
print(ans)

Solution (Python):


n,m,c = list(map(int,input().split()))
b = list(map(int,input().split()))
count = 0
for i in range(n):
    a = list(map(int,input().split()))
    d = [a[j] * b[j] for j in range(m)]
    if sum(d) + c > 0:
        count += 1
        
print(count)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [[0] * m for i in range(n)]
for i in range(n):
    a[i] = list(map(int, input().split()))

count = 0
for i in range(n):
    for j in range(m):
        a[i][j] *= b[j]
    if sum(a[i]) + c > 0:
        count += 1

print(count)

Solution (Python):



'''a,b= map(int,input().split())'''




a,b,c=map(int,input().split())
li=[list(map(int,input().split())) for _ in range(a+1)]
ans=ju=0
for i in range(1,a+1):
  ans=0
  for j in range(b):
    ans+=li[0][j]*li[i][j]
  ans+=c
  if ans>0:
    ju+=1
print(ju)

Solution (Python):



import numpy

def main():
  n, m, c = map(int, input().split())
  B = numpy.array(list(map(int, input().split())))
  count = 0
  for _ in range(n):
    A = numpy.array(list(map(int, input().split())))
    if sum(A*B) + c > 0:
      count += 1
  print(count)


if __name__=='__main__':
  main()

Solution (Python):

import sys


def solve(N: int, M: int, C: int, B: "List[int]", A: "List[List[int]]"):
    a=0
    for j in range(N):
        s=0
        for i in range(M):
            s += A[j][i]*B[i]
        if s > (-1)*C:
            a += 1
    print(a)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    C = int(next(tokens))  
    B = [int(next(tokens)) for _ in range(M)]  
    A = [[int(next(tokens)) for _ in range(M)] for _ in range(N)]  
    solve(N, M, C, B, A)

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np
n,m,c=map(int,input().split())
b=np.array(list(map(int,input().split())))
ac=0
for _ in range(n):
    a=np.array(list(map(int,input().split())))
    if sum(a*b)+c >0:
        ac+=1
print(ac)

Solution (Python):
n,m,c = map(int,input().split())
b=list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]


cnt=0
for i in range(n):
    add=0
    for j in range(m):
        add +=a[i][j]*b[j]
    if add+c > 0:
        cnt+=1
print(cnt)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

count = 0
for i in range(n):
    ret = 0
    for j in range(m):
        ret += a[i][j] * b[j]
    ret += c
    if ret > 0:
        count += 1

print(count)

Solution (Python):


(n,m,c) = map(int, input().rstrip().split(" "))

b = list(map(int, input().rstrip().split(" ")))
a = [list(map(int, input().rstrip().split(" "))) for i in range(n)]

ans = [k for k in [sum([ b[i]*j[i] for i in range(m)]) for j in a] if k + c > 0]

print(len(ans))

Solution (Python):

n,m,c=map(int,input().split())
bl=list(map(int,input().split()))
al=[list(map(int,input().split())) for i in range(n)]

ans=0

for i in range(n):
    templ=al[i]
    total=c
    for j in range(m):
        total+=templ[j]*bl[j]
    if total>0:
        ans+=1

print(ans)

Solution (Python):
import numpy as np


def mul(A, B):
    v = 0
    for a, b in zip(A, B):
        v += a * b
    return v


def main():
    N, M, C = map(int, input().split())

    B = [int(v) for v in input().split()]

    cnt = 0
    for _ in range(N):
        A = [int(v) for v in input().split()]
        if mul(A, B) + C > 0:
            cnt += 1

    print(cnt)


if __name__ == "__main__":
    main()

Solution (Python):
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
cnt = 0
for i in range(n):
  a=list(map(int, input().split()))
  sum = c
  for j in range(m):
  	sum += b[j]*a[j]
  if sum > 0:
    cnt += 1
print(cnt)

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
l=[]
for i in range(n):
        tmp = list(map(int,input().split()))
        l.append(tmp)
ans=0
for i in range(n):
        sm=0
        for j in range(m):
                sm+=l[i][j] * b[j]
        sm+=c
        if sm > 0:
                ans+=1
print(ans)

Solution (Python):
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = []
ans, cnt = 0, 0
for i in range(N):
    A.append(list(map(int, input().split())))
for v in A:
    for i, w in enumerate(v):
        ans += w * B[i]
    if ans + C > 0:
        cnt += 1
    ans = 0
print(cnt)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split())) 
A = [list(map(int, input().split())) for i in range(N)]

cnt = 0

for i in range(N):
  total = C
  for j in range(M):
    total +=A[i][j]*B[j]
  if total >0:
    cnt+=1
print(cnt)

Solution (Python):
n,m,c = map(int,input().split())
b_lst = list(map(int,input().split()))
a_box = []
for i in range(n):
    array = list(map(int,input().split()))
    a_box.append(array)

ans = 0
for i in range(n):
    wa = 0
    for j in range(m):
        wa += b_lst[j] * a_box[i][j]
    if wa + c > 0:
        ans += 1
    
print(ans)

Solution (Python):
N,M,C=map(int,input().split())
B=[int(i) for i in input().split()]
A=[[int(i) for i in input().split()] for j in range(N)]
cnt=0
for a in A:
    tot=C
    for i in range(M):
        tot+=a[i]*B[i]
    if tot>0:
        cnt+=1
print(cnt)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split())

Bin = list(map(int, input().split()))
B = np.array(Bin).T

ans = 0
for i in range(N):
  Ain = list(map(int, input().split()))
  A = np.array(Ain)
  s = np.dot(A, B) + C
  if s > 0:
    ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
As = [list(map(int, input().split())) for _ in range(N)]

ans = 0
for A in As:
    if sum(a * b for a, b in zip(A, B)) + C > 0:
        ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B_li = list(map(int, input().split()))
A_li = []
ans = 0
for i in range(N) :
    A_li = list(map(int, input().split()))
    inner_product = C
    for j in range(M) :
        inner_product +=  A_li[j] * B_li[j]
    if inner_product > 0 :
        ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = [int(x) for x in input().split()]
ans = 0
for s in range(n):
    a = [int(x) for x in input().split()]
    scr = sum([a[i]*b[i] for i in range(m)]) + c
    if scr > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = [int(x) for x in input().split()]
ans = 0
for s in range(n):
    a = [int(x) for x in input().split()]
    scr = sum([a[i]*b[i] for i in range(m)]) + c
    if scr > 0:
        ans += 1
print(ans)

Solution (Python):
import numpy as np

n, m, c = map(int, input().split())
b = np.array(list(map(int, input().split())))
ans = 0
for _ in range(n):
  a = np.array(list(map(int, input().split())))
  if sum(a*b) + c > 0:
    ans += 1
print(ans)

Solution (Python):
N, M, C = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0

for i in range(N):
    a = list(map(int, input().split()))
    add = 0
    for j in range(M):
        add += a[j] * b[j]

    if add + C > 0:
        count += 1

print(count)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))

cnt=0
for i in range(n):
    
    a=list(map(int,input().split()))
    wrk=0
    for j in range(m):
        wrk+=a[j]*b[j]
    if(wrk+c>0):
        cnt+=1
print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
cnt=0
for i in range(n):
    sum=c
    for j in range(m):
        sum+=a[i][j]*b[j]
    if sum > 0:
        cnt+=1
    else:
        cnt=cnt
print(cnt)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = []
for _ in range(n):
    a.append(list(map(int, input().split())))
ans = 0
for i in range(n):
    cal = 0
    for j in range(m):
        cal += a[i][j]*b[j]
    cal += c
    if cal > 0:
        ans += 1

print(ans)

Solution (Python):
[N,M,C] = list(map(int,input().split()))
B = list(map(int,input().split()))
A = []
for i in range(N):
    A.append(list(map(int,input().split())))

cnt = 0
for i in range(N):
    S = 0
    for j in range(M):
        S+=A[i][j]*B[j]
    S+=C
    if S>0:
        cnt+=1
print(cnt)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

cnt = 0
for i in range(N):
    sum = C
    for j in range(M):
        sum += A[i][j]*B[j]
    if sum > 0:
        cnt += 1
    else:
        cnt = cnt
print(cnt)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
count = 0
_sum  = 0
for a in A:
    for y,z in zip(a,B):
        _sum += y * z
    if _sum + C > 0:
        count += 1
    _sum = 0
print(count)

Solution (Python):
N,M,C = map(int,input().split())

B = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]

cnt = 0
for l in A:
    r = 0
    for j in range(M):
        r += l[j]*B[j]
    if r + C > 0:
        cnt+=1
        
print(cnt)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
count = 0
_sum  = 0
for i, x in enumerate(A):
    for j in range(M):
        _sum += x[j] * B[j]
    if _sum + C > 0:
        count += 1
    _sum = 0
print(count)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    a = list(map(int,input().split()))
    t = 0
    for j in range(m):
        t += a[j]*b[j]
    t += c
    if t>0: count+=1
print(count)

Solution (Python):
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//math.factorial(n-r)*math.factorial(r)


n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]

cnt = 0
for i in range(n):
    x = c
    for j in range(m):
        x += a[i][j]*b[j]
    if x > 0:
        cnt += 1
print(cnt)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
for i in range(N):
    A.append(list(map(int, input().split())))

ans = 0
for i in range(N):
    cnt = 0
    for _ in range(M):
        cnt += A[i][_] * B[_]
    if cnt+C > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c =map(int,input().split())
B = [int(i) for i in input().split()]

A = [[int(i) for i in input().split()] for _ in range(n)]
ans = 0

ans_list = []
for i in range(n):
  x = 0
  for j in range(m):
    x += A[i][j]*B[j]
    if j == m-1:
      ans_list.append(x+c)
      
for i in range(len(ans_list)):
  if ans_list[i] >0:
               ans+=1
               
print(ans)

Solution (Python):
N_ko, M_d, Const = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0

for i in range(N_ko):
    summ = 0
    
    A = list(map(int, input().split()))
    
    for j in range(M_d):
        summ += A[j] * B[j]
    
    if (summ + Const > 0):
        cnt += 1

print(cnt)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))

ans = 0
for i in range(N):
    x = 0
    A = list(map(int,input().split()))
    for j in range(M):
        x += A[j]*B[j]
    if x + C > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
p = 0
for i in range(n):
    x = 0
    a = list(map(int,input().split()))
    for j in range(m):
        x += a[j] * b[j]
    if x > (-c):
        p += 1

print(p)

Solution (Python):
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(N)]

ans = 0
solve = 0

for i in range(N):
    for j in range(M):
        solve += A[i][j]*B[j]
        
    if solve > -C:
        ans+=1
    solve = 0
    
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
N, M, C = map(int, input().split())
B = [int(x) for x in input().split()]
A = [list(map(int,input().split())) for i in range(N)]

ans = 0

for i in range(N) :
    temp = 0
    for j in range(M) :
        temp += A[i][j] * B[j]
    if temp + C > 0 :
        ans += 1

print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
ans = 0
for _ in range(n):
    a = list(map(int,input().split()))
    res = c
    for i in range(m):
        res += b[i]*a[i]
    if res > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
ans = 0
for i in range(n):
    cnt = 0
    a = list(map(int,input().split()))
    for j in range(m):
       cnt += a[j] * b[j]
    cnt += c
    if cnt > 0:
        ans += 1
print(ans)

Solution (Python):
import numpy as np

n, m, c = map(int, input().split())
B = np.array(list(map(int, input().split())))

ans = 0
for _ in range(n):
    A = np.array(list(map(int, input().split())))
    if np.dot(A, B) + c > 0:
        ans += 1
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for _ in range(n):
    A = list(map(int, input().split()))
    temp = 0
    for a, b in zip(A, B):
        temp += a*b
    if temp + c > 0:
        ans += 1
print(ans)

Solution (Python):
n, m, c = list(map(int, input().split()))
B = list(map(int, input().split()))
A = (list(map(int, input().split())) for _ in range(n))
ans = 0
cnt = 0
for i, u in enumerate(A):
    for j, v in enumerate(u):
        ans += v * B[j]

    ans += c
    if ans > 0:
        cnt += 1
    ans = 0
print(cnt)

Solution (Python):
n,m,c = map(int,input().split())
blist = list(map(int,input().split()))
cnt = 0
for _ in range(n):
    alist = list(map(int,input().split()))
    if sum([a*b for a,b in zip(alist,blist)]) + c > 0:
        cnt += 1

print(cnt)

Solution (Python):



N,M,C = list(map(int, input().rstrip().split()))
B_list = list(map(int, input().rstrip().split()))


count=0
for n in range(N):
    A_list = list(map(int, input().rstrip().split()))
    
    sum=0
    for m in range(M):
        sum += A_list[m] * B_list[m]
    
    sum += C
    
    if sum > 0:
        count += 1
    
print(count)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]

count,sum=0,c
for i in range(n):
  sum=c
  for j in range(m):
    sum+=a[i][j]*b[j]
  if sum>0:
    count+=1
    
print(count)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[input().split() for i in range (n)]
d=0

for k in range(n):

    ab=0
    for j in range (m):
        
        ab+=int(a[k][j])*b[j]
    if ab+c>0:
        d+=1
print(d)

Solution (Python):
N,M,C=map(int,input().split())
b_list=list(map(int,input().split()))
a_list=[]
for _ in range(N):
    a=list(map(int,input().split()))
    a_list.append(a)
cnt=0    
for i in a_list:
    ab=[j*k for j,k in zip(i,b_list)]
    hantei=sum(ab)+C
    if hantei>0:
        cnt+=1
print(cnt)

Solution (Python):
import numpy as np
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
d = np.zeros((n,m))
for i in range(n):
    a = list(map(int,input().split()))
    for j in range(len(a)):
        d[i][j] = a[j]
cnt = 0
for i in range(n):
    ans = 0
    for j in range(m):
        ans += d[i][j]*b[j]
    ans += c
    if ans>0:
        cnt+=1
print(cnt)

Solution (Python):
N,M,C =map(int, input().split())
B = list(map(int,input().split()))
A = []
for i in range(N):
    array = list(map(int, input().strip().split()))
    A.append(array)

sum_a = [0]*N
count = 0
for i in range(0,N):
    for j in range(0,M):
        sum_a[i] += A[i][j]*B[j]

    sum_a[i] += C
    if(sum_a[i] > 0):
        count+=1
    

print(count)

Solution (Python):

N,M,C=map(int,input().split())
B=list(map(int,input().split()))
def F(A):
    return sum([A[i]*B[i] for i in range(M)])+C

cnt=0
for _ in range(N):
    A=list(map(int,input().split()))
    if F(A)>0:
        cnt+=1

print(cnt)

Solution (Python):
n,m,k = map(int, input().split())
l1 = list(map(int, input().split()))
ans = 0
sc = 0

for i in range(n):
  sc = 0
  lt = list(map(int,input().split()))
  for j in range(m):
    sc += l1[j]*lt[j]

  if sc + k> 0:
    ans += 1
print(ans)