Problem:


Score : 200 points

Problem Statement

There are N rectangular plate materials made of special metal called AtCoder Alloy.
The dimensions of the i-th material are A_i \times B_i (A_i vertically and B_i horizontally).

Takahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \times W.
He is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.
When cutting a material, the cuts must be parallel to one of the sides of the material.
Also, the materials have fixed directions and cannot be rotated.
For example, a 5 \times 3 material cannot be used as a 3 \times 5 plate.

Out of the N materials, how many can produce an H \times W plate if properly cut?

Constraints

1 \leq N \leq 1000

1 \leq H \leq 10^9

1 \leq W \leq 10^9

1 \leq A_i \leq 10^9

1 \leq B_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N H W
A_1 B_1
A_2 B_2
:
A_N B_N

Output

Print the answer.

Sample Input 1

3 5 2
10 3
5 2
2 5

Sample Output 1

2

Takahashi wants a 5 \times 2 plate.

The dimensions of the first material are 10 \times 3. We can obtain a 5 \times 2 plate by properly cutting it.

The dimensions of the second material are 5 \times 2. We can obtain a 5 \times 2 plate without cutting it.

The dimensions of the third material are 2 \times 5. We cannot obtain a 5 \times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \times 2 plate.

Sample Input 2

10 587586158 185430194
894597290 708587790
680395892 306946994
590262034 785368612
922328576 106880540
847058850 326169610
936315062 193149191
702035777 223363392
11672949 146832978
779291680 334178158
615808191 701464268

Sample Output 2

8



Sample input:
3 5 2
10 3
5 2
2 5


Sample output:
2

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N, H, W = map(int, input().split())
ans = 0
for i in range(N):
    A, B = map(int, input().split())
    if H <= A and W <= B:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
c = []
for i in range(n):#h:高さ
    c.append([int(m) for m in input().split()])

ans = 0
for i in range(n):
    if c[i][0] >= h and c[i][1] >= w:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n,h,w = map(int, input().split())
ans=0
for i in range(n):
    a,b = map(int, input().split())
    if a>=h and b>=w:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ans = 0
for i in range(N):
	A, B = map(int, input().split())
	if A >= H and B >= W:
		ans = ans +1
print(ans)

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math
import fractions
def j(a):
    if a: print("AC")
    else :print("WA")


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

#x = ip()                              #入力整数1つ
#x,y = (int(i) for i in input().split())      #入力整数横2つ
x,y,z = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列


num=0
for d in range(x):
    a,b = (int(i) for i in input().split())
    if a>=y and b>=z:
        num+=1
print(num)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
ans=0
for i in range(n):
    x,y=map(int,input().split())
    if x>=h and y>=w:
        ans+=1

print(ans)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
ans = 0

for i in range(n):
    a, b = map(int, input().split())
    if h <= a and w <= b:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
[n,h,w] = [int(i) for i in input().split()]
a = {}
for i in range(n):
    a[i] = [int(i) for i in input().split()]
cnt = 0
for i in a.values():
    if i[0] >= h and i[1] >= w:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
N, H, W = [int(_) for _ in input().split()]

count = 0
for _ in range(N):
    A, B = [int(_) for _ in input().split()]
    if A >= H and B >= W:
        count += 1

print(count)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
ans=chk=0
for i in range(n):
    y,x=map(int,input().split())
    if h<=y and w<=x: ans+=1
print(ans)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
AB=[list(map(int,input().split())) for i in range(n)]
count=0
for a,b in AB:
  if a>=h and b>=w:
    count+=1
print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split(' '))
count = 0
for i in range(N):
    Ai, Bi = map(int, input().split(' '))
    if Ai >= H and Bi >= W:
        count += 1
print(count)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())

ans = 0
for i in range(n):
    a, b = map(int, input().split())
    if h <= a and w <= b:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
count = 0
for i in range(N):
    A,B = map(int,input().split())
    if A >= H and B >= W:
        count += 1
print(count)

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(N)]
ans = 0

for i in range(N):
    if L[i][0]>=H and L[i][1]>=W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ans = 0

for i in range(N):
    h, w = map(int, input().split())
    if h >= H and w >= W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n, h, w = map(int,input().split())
cnt = 0
for i in range(n):
  a,b=map(int,input().split())
  if a>=h and b>=w:
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
def caddi2018b_b():
    n, h, w = map(int, input().split())
    boards = [list(map(int, input().split())) for _ in range(n)]
    ans = 0

    for i in range(n):
        if boards[i][0] >= h and boards[i][1]>=w:
            ans += 1
    print(ans)


caddi2018b_b()

Submission status: Accepted

Solution code:
N,H,W=map(int,input().split())

count=0
for i in range(N):
  A,B=map(int,input().split())
  if H>A or W>B:
    continue;
  count+=1
  
print(count)

Submission status: Accepted

Solution code:
class Rect:
    def __init__(self, a, b):
        self.a = a
        self.b = b


N, H, W = map(int, input().split())
rects = []
for _ in range(N):
    a, b = map(int, input().split())
    rects.append(Rect(a, b))


cnt = 0
for rect in rects:
    if rect.a >= H and rect.b >= W:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
	#n=int(input())
    #a=list(map(int,sys.stdin.readline().split(' ')))
    n,h,w= map(int, sys.stdin.readline().split(' '))
    ans=0
    for i in range(n):
    	a,b= map(int, sys.stdin.readline().split(' '))
    	if(a>=h and b>=w):
    		ans+=1
    print(ans)

    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Accepted

Solution code:
N,H,W = map(int,input().split())
AB = []
for i in range(N):
    AB.append(list(map(int,input().split())))

res = 0
for i in range(N):
    if AB[i][0] >= H and AB[i][1] >= W:
        res += 1

print(res)

Submission status: Accepted

Solution code:
# encoding: utf-8
N, H, W = map(int, input().split())
AB = [list(map(int, input().split())) for i in range(N)]

ans = 0
for Ai, Bi in AB:
    if H <= Ai and W <= Bi: ans += 1

print(ans)

Submission status: Accepted

Solution code:
n,h,w=map(int, input().split(" "))
count=0
for i in range(n):
    a,b=map(int, input().split(" "))
    if a>=h and b>=w:
        count+=1
print(count)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())

ans = 0
for i in range(N):
  a, b = map(int, input().split())
  if a >= H and b >= W:
    ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
N,H,W = list(map(int, input().split()))
cnt = 0
for i in range(N):
    a,b = list(map(int, input().split()))
    if (a>=H) & (b>=W):
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
res = 0
for i in range(n):
    a, b = map(int, input().split())
    if a >= h and b >= w:
        res += 1
print(res)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
c = 0
for i in range(n):
    a,b = map(int,input().split())
    if a>=h and b>=w:
        c += 1
print(c)

Submission status: Accepted

Solution code:
n,h,w=map(int,input().split())
c=0
for i in range(n):
  a,b=map(int,input().split())
  if h<=a and w<=b:
    c+=1
print(c)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]

ans = 0
for a, b in AB:
    if a >= H and b >= W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
L = [list(map(int, input().split())) for i in range(N)]
res = 0
for i in range(N):
    if L[i][0] >= H and L[i][1] >= W:
        res += 1
print(res)

Submission status: Accepted

Solution code:
n, h, w = [int(_) for _ in input().split()]

a = []
b = []
for i in range(n):
    ai, bi = [int(_) for _ in input().split()]
    a.append(ai)
    b.append(bi)

counter = 0
for i in range(n):
    if a[i] >= h and b[i] >= w:
        counter += 1
print(counter)

Submission status: Accepted

Solution code:
n,h,w = map(int, input().split())

cnt = 0
for i in range(n):
    a_, b_ = map(int, input().split())
    
    if a_ >=h and b_>=w:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
cnt = 0

for i in range(N):
    a, b = map(int, input().split())
    if a >= H and b >= W:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())
a_list = []
b_list = []

for i in range(n):
    a, b = map(int, input().split())
    a_list.append(a)
    b_list.append(b)
count = 0
for i in range(n):
    a = a_list[i]
    b = b_list[i]

    if a >= h and b >= w:
        count += 1
print(count)

Submission status: Accepted

Solution code:
n,h,w = list(map(int, input().split()))
c = 0
for i in range(n):
  a,b = list(map(int, input().split()))
  if a >= h and b >= w:
    c += 1
print(c)

Submission status: Accepted

Solution code:
N, H, W = [int(x) for x in input().split()]
ans = 0
for _ in range(N):
    a, b = [int(x) for x in input().split()]
    ans += H <= a and W <= b
print(ans)

Submission status: Accepted

Solution code:
N, H, W = (int(i) for i in input().split())

res = 0
for i in range(N):
    A, B = (int(i) for i in input().split())
    if H <= A and W <= B:
        res += 1

print(res)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())

a = [i for i in range(n)]
b = [i for i in range(n)]

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

ans = 0

for i in range(n):
    if a[i] >= h and b[i] >= w:
        ans += 1


print(ans)

Submission status: Accepted

Solution code:
n,h,w = map(int, raw_input().split())
ans = 0
for i in xrange(n):
	a,b = map(int, raw_input().split())
	if a >= h and b >= w:
		ans += 1
print ans

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
ans = 0
for i in range(N):
    a, b = map(int, input().split())
    if H <= a and W <= b:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n, h, w =map(int, input().split())
array = [[int(x) for x in input().split()] for y in range(n)]
cnt = 0
for i, j in array:
    if i >= h and j >= w:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
from collections import Counter


input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7


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


N, H, W = inpl()

ans = 0
for _ in range(N):
    a, b = inpl()
    if a >= H and b >= W:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
N, H, W = map(int, input().split())
res = 0

for i in range(N):
  a, b = map(int, input().split())
  if H <= a and W <= b:
    res += 1

print(res)

Submission status: Accepted

Solution code:
n, h, w = map(int, input().split())

ans = 0
for _ in range(n):
    a, b = map(int, input().split())

    ans += int(a >= h and b >= w)

print(ans)

Submission status: Accepted

Solution code:
n,h,w = map(int,input().split())
count = 0
for i in range(n):
    a,b = map(int,input().split())
    if a>=h and b>=w:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
count=0
n,h,w=map(int, input().split())

x = [list(map(int, input().split())) for i in range(n)]

for i in x
 if x[i][0]>=h and x[i][1]>=w:
    count=count+1

print(count)

Submission status: Runtime Error

Solution code:
count=0
n,h,w=map(int, input().split())

x = [list(map(int, input().split())) for i in range(n-1)]

for i in range(n-1)
 if x[i][0]>=h and x[i][1]>=w:
    count=count+1

print(count)

Submission status: Runtime Error

Solution code:
count=0
n,h,w=map(int, input().split())

x = [list(map(int, input().split())) for i in n]

for i in n
 if x[i][0]>=h and x[i][1]>=w:
    count=count+1

print(count)

Submission status: Runtime Error

Solution code:
count=0

n,h,w=map(int, input().split())

x = [list(map(int, input().split())) for i in range(n)]

for i in range(n)
 if x[i][0]>=h and x[i][1]>=w:
    count+=1

print(count)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
 
int main() {
  long long N,H,W,ans;
	cin>>N>>H>>W;
	ans=0;
	rep(i,N){
	  long long A,B;
		cin>>A>>B;
		if(A>=H && B>=W) ans++;
	}
	cout<<ans<<endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
N,H,W=map(int,input().split())
ans=0
for i in range(N):
  a,b=map(int,input().split())
  if a>=H and b=W:
    ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
n, h, w = map(int, input().split())
a_b = [list(map(int, input().split())) for _ range(n)]
cnt = 0
for i in range(n):
  if a_b[i][0] >= h and a_b[i][1] >= w:
    cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
N,H,W=map(int,input().split())
c=0
for i in range(N):
  h,w=map(int,input().split())
  if ((h>=H) and (w>=W)):
	c=c+1
print(c)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; 
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n,h,w;cin>>n>>h>>w;
    int ans=0;
    rep(i,n){
        int a,b;cin>>a>>b;
        if(a>=h and b>=w)ans++;
    }
    cout<<ans<<endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
N,H,W = map(int,input().split())
     
ans = 0
     
for i in range(N):
  A,B = map(int,input().split())
  if (A => H) and (B => W):
     ans += 1
        
print (ans)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
using namespace std;
int main(void){
    
    long int n,h,w,ans=0,i,ab[1000][2];
    cin>>n>>h>>w;
    
    for(i=0;i<n;i++){
        for(int j=0;j<2;j++){
            cin>>ab[i][j];
        }
    }
    
    for(i=0;i<n;i++){
        if(ab[i][0] >= h && ab[i][1] >= w)
            ans++;
    }
    cout<<ans;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;
int main(void){
    // Your code here!
    long int n,h,w,ans=0,ab[1000][2];
    cin>>n>>h>>w;
    
    //素材の寸法の入力
    for(int i=0;i<n;i++){
        for(int j=0;j<2;j++){
            cin>>ab[i][j];
            
        }
    }
    
    for(int i=0;i<n;i++){
            if(ab[i][0]>=h && ab[i][1]>=w){
                ans++;
            }
    }
    cout<<ans;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;
int main(void){
    // Your code here!
    long int n,h,w,ans=0,ab[1000][2];
    cin>>n>>h>>w;
    
    //素材の寸法の入力
    for(int i=0;i<n;i++){
        for(int j=0;j<2;j++){
            cin>>ab[i][j];
            
        }
    }
    
    for(int i=0;i<n;i++){
            if(ab[i][0]>=h && ab[i][1]>=w)
                ans++;
    }
    cout<<ans;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
using namespace std;
int main(void){
    // Your code here!
    int n,h,w,ans=0,ab[1000][2];
    cin>>n>>h>>w;
    
    //素材の寸法の入力
    for(int i=0;i<n;i++){
        for(int j=0;j<2;j++){
            cin>>ab[i][j];
            
        }
    }
    
    for(int i=0;i<n;i++){
            if(ab[i][0]>=h && ab[i][1]>=w)
                ans++;
    }
    cout<<ans;
}

Submission status: Runtime Error

Solution code:
#include <cstdio>

int main()
{
    int N, H, W;
    int ans = 0;

    scanf("%d%d%d", &N, &H, &W);
    for (int i = 0; i < N; ++i) {
        int Ai, Bi;
        scanf("%d%d", &Ai, &Bi);

        if (H <= Ai && W <= Bi) ++ans;
    }

    printf("%d\n", ans);
    return 0;
}

Submission status: Runtime Error

Solution code:
n, h, w = [int(i) for i in input().split()]
print(sum([lambda a, b: 1 if h <= a and w <= b else 0, [int(i) for i in input().split()] for _ in range(n)]))

Submission status: Runtime Error

Solution code:
n,h,w=map(int,input().split())
cnt=0
for i in range(n):
  a,b=map(int,input().split)
  if h<=a and w<=b:
    cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
N, H, W = map(int, input().split())
AB = [[int(_) for _ in input().split()] for _ in range(N)]
ans = 0

for i in AB:
    if i[0] >= H and AB[1] >= W:
        ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
n,h,w= map(int,input().split())
c = 0
for _ in range(int(input()):
	a,b = map(int,input().split())
    if a >= h and b >= w:
		c += 1
print(c)

Submission status: Runtime Error

Solution code:
n,h,w=map(int,input().split())
ab=[list(int(input()).split()) for i in range(n)]
c=0
for i in ab:
  if i[0] >= h and i[1] >= w:
    c+=1
    
print(c)

Submission status: Runtime Error

Solution code:
N,H,W=map(int,input())
ans=0
for _ in range(N):
    a,b=map(int,input().split())
    if a>=H and b>=W:
        ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
N, H, W = map(int,input().split())

count =0

for num in range(N):
  A, B = map(int,inp().split())
  if H >=A and W>=B:
    count +=1
print(count)

Submission status: Runtime Error

Solution code:
n,h,w=map(int,input().split())
cnt=0
for i in range(n):
  a,b=map(int,input().split())
  cnt+=1 if a>=h and b>=w
print(cnt)

Submission status: Runtime Error

Solution code:
N = int(input())
H = int(input())
W = int(input())
n = 0
while n<N:
    A = int(input())
    B = int(input())
    n +=1
if (H == A and W == B) or (H == A/2 and W == B/2):
    cnt = +1
print(int(cnt))

Submission status: Runtime Error

Solution code:
N, H, W = map(int, input().split())
A = []
B = []
counter = 0
for i in range(0,N):
    a,b  = map(int, input().split())
    if a=>H and b=>W:
        counter +=1
print(counter)

Submission status: Runtime Error

Solution code:
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
a =[]
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Submission status: Runtime Error

Solution code:
def read():
    N, H, W = list(map(int, input().strip().split()))
    A = []
    B = []
    for i in range(N):
        a, b = list(map(int, input().strip().split()))
        A.append(a)
        B.append(b)
    return N, H, W, A, B


def solve(N, H, W, A, B):
    count = 0
    for i in range(N):
        if A[i] >= H and B[i] >= W:
            count += 1
    return count


if __name__ == '__main__':
    inputs = read()
    print(solve(inputs))

Submission status: Runtime Error

Solution code:
N, H, W = list(map(int, input().strip().split(' ')))

AB = []

cnt = 0

for i in range(N):
	AB.append(input().strip().split(' '))	#[A][B]
	

for i in range(N):
	if int(AB[i][0]) >= H:
		if int(AB[0][i]) >= W:
			cnt += 1

		
		


	
print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
h = int(input())
w = int(input())
a = []
b = []
i = 1
while i <= n:
    a.append(int(input))
    b.append(int(input))

i = 0
flag = 0

while i < n:
    if a[i] >= h and b[i] >=w:
        flag = flag + 1
    i = i + 1
print(flag)

Submission status: Runtime Error

Solution code:
import sys
lines = [map(int, line.strip().split(' ')) for line in sys.sydin]
print(sum([1 for h,w in lines[1:] if lines[1] <= h and lines[2] <= w]))

Submission status: Runtime Error

Solution code:
n, h, w = map(int, input().split())
ans = 0
for i in range(n):
    a, b = map(int, input().split())
    if a >= h and b >= w:
        ans += 1
print(ans

Submission status: Runtime Error

Solution code:
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Submission status: Runtime Error

Solution code:
N,H,W = map(int, raw_input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Submission status: Runtime Error

Solution code:
n, h, w = map(int, input().split())
tup_list = []
for i in range(n):
    tup_list.append((map(int, input().split())))
count = 0
for tuple in tup_list:
    if tuple[0] >= h and tuple[1] >= w:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
n, h, w = map(int, input().split())
tup_list = []
for i in range(n):
    tup_list.append((map(int, input().split())))
print(tup_list)
count = 0
for tuple in tup_list:
    if tuple[0] >= h and tuple[1] >= w:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
N,W,H=[int(i) for i in input.split()]

ans=0

for i in range(N):
    h,w=[int(x) for x in input.split()]
    if h<=H and w<= W:
        ans+=1

print(ans)

Submission status: Runtime Error

Solution code:
N,H,W = map(int, raw_input().split())
a = []
a = []
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Submission status: Runtime Error

Solution code:
n, h, w = map(int, input().split())
tup_list = []
for i in range(n):
    tup_list.append((input().split()))
count = 0
for tuple in tup_list:
    if tuple[0] > h and tuple[1] > w:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
N,W,H=[int(i) for i in input.split()]

ans=0

for i in range(N):
  h,w=[int(x) for x in input.split()]
  if h<=H and w<= W:
    ans+=1

print(ans)

Submission status: Runtime Error

Solution code:
N,W,H=[int(i) for i in input.split()]

nas=0

for i in range(N):
  h,w=[int(x) for x in input.split()]
  if h<=H and w<= W:
    ans+=1

print(ans)

Submission status: Runtime Error

Solution code:
n, h, w = map(int, input().split())
tup_list = []
for i in n:
    tup_list.append((input().split()))
count = 0
for tuple in tup_list:
    if tuple[0] > h and tuple[1] > w:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
#include<iostream>
using namespace std;

int main() {
    int n, h, w, cnt=0;
    cin >> n >> h >> w;
    for (int i=0; i<n; i++) {
        int a, b;
        cin >> a >> b;
        if (a>=h && b>=w) {
            cnt += 1;
        }
    }
    cout << cnt << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
10 587586158 185430194
894597290 708587790
680395892 306946994
590262034 785368612
922328576 106880540
847058850 326169610
936315062 193149191
702035777 223363392
11672949 146832978
779291680 334178158
615808191 701464268

Submission status: Runtime Error

Solution code:
N, H, W = map(int, input().split())
n = 0
for i in range(N):
  A, B = map(int, input().split)
  if A >= H and B >= W:
    n += 1
print(n)

Submission status: Runtime Error

Solution code:
from numpy import array
n,h,w = [int(x) for x in input().split()]
c = 0
for _ in range(n):
  d = array([h,w])array([int(x) for x in input().split()])
  c += 1 if False in d else 0
print(c)

Submission status: Runtime Error

Solution code:
 n,h,w = list(map(int, input().split()))
cnt = 0
for i in range(n):
    a, b = list(map(int, input().split()))
    if a>=h and b>=w:
        cnt += 1
        
print(cnt)

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main(void){
int n,h,w,s=0;
int a,b;
cin>>n>>h>>w;
for(int i=0;i<n;i++){
    cin>>a>>b;
    if(a>=h&&b>=w){
        s++;
    }
}
cout<<s<<endl;
}

Submission status: Runtime Error

Solution code:
N,H,W = map(int,input().split())
L = []
for i in range(N) :
    a,b = map(int,input().split())
    if (a >= H) and (b >= W) :
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
N, H, W = map(int, input.strip().split())
A, B = [], []
for _ in range(N):
  a, b = map(int, input().strip().split())
  A.append(a)
  B.append(b)

i = 0
for a, b in zip(A, B):
  if a >= H and b >= W:
    i += 1
print(i)