/*                          Jai Sree Ram                         */
/*                      Compete against yourself                */

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <queue>
#include <cstring>
#include <set>
#include <bitset>
#include <map>
#include <chrono>
#include <random>
#include <unordered_map>
#include <stdio.h>

using namespace std;

#define rep(i,n) for(int i = 0 ; i < n; i++)
#define dep(i,n) for(int i = n-1 ; i >= 0; i--)
#define re1(i,n) for(int i = 1 ; i <= n; i++)
#define de1(i,n) for(int i = n ; i > 0; i--)
#define rab(i,a,b) for(int i = a ; i < b; i++)
#define dab(i,a,b) for(int i = b ; i >= a; i--)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define mod 1000000007
#define debug(x) cout<<#x<<" = "<<x<<endl
#define debug1(x) cout<<#x<<" = "<<x<<endl
#define debug2(x,y) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define debug3(x,y,z) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl
#define debug4(x,y,z,q) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl
#define prq(x) priority_queue<x,vector<x> >

typedef long long ll;
typedef double db;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<ll,ll> pll;
typedef vector<vector<int> > vvi;
typedef pair<pii,int> ppi;

pll inv_help(ll a,ll b){
    pll res;
    res.F=1;
    res.S=0;
    if(b==0) return res;
    else{
        pll res1 = inv_help(b,a%b);
        res.F = res1.S;
        res.S = res1.F - (a/b)*res1.S;
        return res;
    }
}

ll inv(ll a,ll b){
    pll res = inv_help(a,b);
    ll x = res.F;
    if(x>0) x=x%b;
    if(x<0) x=(b - (-x)%b)%b;
    return x;
}

vector<int> l;
int N;

int binsearch(int p,int l_bnd){
    int i=l_bnd,j=N-1,k;
    if(l_bnd>N-1) return -1;
    if(l[N-1]<p) return -1;
    else if(l[i]>p) return i;
    else{
        while(i!=j){
            k=(i+j)/2;
            if(i==j){
                return i;
            }
            else if(i==j-1){
                if(l[i]==p) return i;
                else return i+1;
            }
            else if(l[k]<p) {
                i=k+1;
            }
            else if(l[k]>=p){
                j=k;
            }
        }
        return i;
    }
}

bool isPrime(int n)
{
    if (n <= 1)
        return false;
    if (n <= 3)
        return true;

    if (n % 2 == 0 || n % 3 == 0)
        return false;
    for (int i = 5; i * i <= n; i = i + 6)
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    return true;
}

void factorise(ll a,vector<pii> &u,vector<int> prime){
    int sz = prime.size();
    int i=0;
    while(i<sz && a>1){
        if(a%prime[i]==0){
            int num=0;
            while(a%prime[i]==0){
                a = a/prime[i];
                num++;
            }
            u.pb({prime[i],num});
        }
        i++;
    }
    return;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n , m ;
    cin>> n >> m ;
    int count = 0 ;
    while ( n-- ) {
        string s ;
        int r ;
        cin >> s >> r;
        if (r >= 1200){
            bool flag = false ;
            for(int i = 0 ; i< 4 ;i++){
                if(s[i] == 'x') flag = true ;
            }
            count += flag;
        }
    }
    cout << count << endl;

    return 0;
}