#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <utility>

typedef long long ll;
typedef unsigned long long ull;

#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)
#define print(x) std::cout << x << std::endl;

const ll INF = 1e18;
const ll MOD = 1e9+7;

ll gcd(ll a, ll b) { return a == 0 ? b : gcd(b%a, a); }
ll mod(ll a) { return a % MOD < 0 ? (a % MOD) + MOD : a % MOD; }
ll mod_add(ll a, ll b) { return (a%MOD + b%MOD) % MOD; }
ll mod_sub(ll a, ll b) { return mod((a%MOD - b%MOD) % MOD); }
ll mod_mul(ll a, ll b) { return (a%MOD * b%MOD) % MOD; }
ll mod_pow(ll a, ll b) 
{
    if(b == 0) return 1;
    ll p = mod_pow(a, b/2) % MOD;
    p = mod_mul(p, p);
    return (b%2 == 0) ? p : mod_mul(a, p);
}
ll mod_inv(ll a) { return mod_pow(a, MOD-2); }
ll mod_div(ll a, ll b) { return a%MOD * mod_inv(b) % MOD; }
ll mod_summation(ll N) { return mod_div(mod_mul(N, mod_add(N, 1)), 2); }


int main()
{
    int N, X, V, P;
    int res = -1;
    std::cin >> N >> X;
    X *= 100;

    floop(N)
    {
        std::cin >> V >> P;

        if(X > -1)
        {
            X -= (V*P);
            if(X <= -1)
                res = i+1;
        }
    }

    print(res);

    return 0;
}
#include <iostream>
using namespace std;
int main()
{
  long long A, B, C;
  cin >> A >> B >> C;
  if ( C % 2 == 0 )
  {
    A = A>0?A:-A;
    B = B>0?B:-B;
  }
  if ( A > B ) cout << ">";
  else if ( A < B ) cout << "<";
  else cout << "=";
}