#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int x_dir[] = {0, 1, 0, -1};
const int y_dir[] = {-1, 0, 1, 0};

int main()
{
    int n, m;
    cin >> n >> m;
    vector<string> s(n);
    vector<int> r(n);
    for (int i = 0; i < n; i++)
    {
        cin >> s[i] >> r[i];
    }

    int ret = 0;
    for (int i=0; i<n; ++i) {
        bool isKizetu = false;
        if (r[i] >= 1200) {
            for (int j=0; j<4; ++j) {
                if (s[i][j] != 'o') {
                    isKizetu = true;
                    break;
                }
            }
        }
        if (isKizetu) {
            ret++;
        }
    }
    cout << ret << endl;
    return 0;
}