C++ :

#include<bits/stdc++.h>
using namespace std;
int a[100];
int main()//主函数 
{
	int n,m,fsx,sum=0;
	cin>>n>>m>>fsx;
	for(int i=1;i<=n;i++)
	{
		int s=0,x;
		for(int j=1;j<=m;j++)
		{
			cin>>x;
			s+=x;
		}
		if(s>fsx) sum++;
	}
	cout<<sum;
	
	
	
   	return 0;
} 

Pascal :

var n,m,i,j,k,a,b,c:longint; s:array [1..12414] of longint;
begin
    readln(n,m,k);
    for i:=1 to n do
        for j:=1 to m do
        begin
            read(c);
            s[i]:=s[i]+c;
        end;
    for i:=1 to n do if s[i]>=k then a:=a+1;
    writeln(a);
end.