1. 


/**
* Miesel Christoph
* Seilbeck Robert
* Wolfram Andre
*
* Zeit 0.090
*/


import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Relational {


public static void main(String[] args) throws Exception {

// Einlesevorgang
BufferedReader reader = new BufferedReader(new InputStreamReader(
System.in));
String line = reader.readLine();

// Einlesen der Anzahl Wertepaare
int counter = Integer.parseInt(line);
int[] inputArray = new int[counter * 2];

// Schleife über alle Zeilen und Vergleich
for (int i = 0; i < counter * 2; i += 2) {
line = reader.readLine();
String[] tmp = line.split(" ");
inputArray[i] = Integer.parseInt(tmp[0]);
inputArray[i + 1] = Integer.parseInt(tmp[1]);
if (inputArray[i] > inputArray[i + 1]) {
System.out.println(">");
} else if (inputArray[i] < inputArray[i + 1]) {
System.out.println("<");
} else
System.out.println("=");

}
}

}



2.

/**
* ACM Problem #11172 (Relational Operator)
*
* @author Christian Posselt
* @author Jonathan Schubert
* @version 1.0, 03/23/2009
*
* Status : accepted
* Runtime: 0.100
*/

import java.io.*;
import java.util.StringTokenizer;

public class Main {

public static void main(String[] args) throws Exception
{
//defining of all needed variables
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
final int amount;
int numberA, numberB, difference;
String line;
StringTokenizer data;

//read in of the amount of lines of comparisons
line = reader.readLine();
data = new StringTokenizer(line);
amount = Integer.parseInt(data.nextToken());

for(int i=1;i<=amount; i++)
{
line = reader.readLine();
data = new StringTokenizer(line);

numberA = Integer.parseInt(data.nextToken());
numberB = Integer.parseInt(data.nextToken());

difference = numberA - numberB;

//System out depending on the difference
if(difference==0)
System.out.println("=");
else if(difference>0)
System.out.println(">");
else
System.out.println("<");
}

}

}


3.


/*
*    Markus Mohr, Rolf Schirm, Franz Mathauser
*    Datum: 24.03.09
*    IFB 2C
*    ACCEPTED: 11172, 0.100
*/

// 11172 Relational Operator

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Main {

public static void main(String... args) throws IOException{

BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int a;
int b;

String startWert = reader.readLine();
StringTokenizer anz = new StringTokenizer(startWert);
int anzWert = Integer.parseInt(anz.nextToken());

for(int i=0; i < anzWert; i++) {

String line = reader.readLine();
StringTokenizer tokenizer = new StringTokenizer(line);



a = Integer.parseInt(tokenizer.nextToken());
b = Integer.parseInt(tokenizer.nextToken());
if(a < b)
System.out.println("<");
if(a > b)
System.out.println(">");
if(a == b)
System.out.println("=");




}
}
}

4.

/* @Problem 11172
* @Autor Markus Stadler
*/
import java.io.*;
import java.util.StringTokenizer;


class Main {
public static void main (String[] args) throws Exception {

BufferedReader buin = new BufferedReader (new InputStreamReader (System.in));

String firstline = buin.readLine();
int lines = Integer.valueOf(firstline);

for (int count = 0; count < lines; count++){
String line = buin.readLine();
StringTokenizer str = new StringTokenizer (line);
int left = Integer.valueOf(str.nextToken());
int right = Integer.valueOf(str.nextToken());
if (left == right){
System.out.println ("=");
}
else {
if (left < right){
System.out.println ("<");
}
else {
System.out.println (">");
}
}
}
}
}


5.

/* Robert Reichart
* Martin Pesl
* Elvin Uzeirovic

Run Time Submission Date
0.110 2009-03-23 14:51:10
*/
import java.io.*;
class Main{

public static void main(String... args) throws IOException{
//Einlesen des InputStreams und Abspeichern als ein langer String
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
StringBuilder eingabebuilder = new StringBuilder();

while (input.ready()){
if (eingabebuilder.length()==0){
eingabebuilder.append(input.readLine());
}
else {
if (eingabebuilder.charAt(eingabebuilder.length()-1)==' '){eingabebuilder.append(input.readLine());
} else {
eingabebuilder.append(" ");
eingabebuilder.append(input.readLine());
}
}
}
input.close();

String eingabe=eingabebuilder.toString();
//Einzelne Werte des Strings in ein Array speichern
String[] array = eingabe.split(" ");
//String array in int array umwandeln
Integer[] werte = new Integer[array.length];
for (int i=0;i<array.length;i++){
werte[i]=Integer.parseInt(array[i]);
}

int n = werte[0]*2;
for (int i=1; i<=n;i=i+2){
int k = werte[i]-werte[i+1];
if (k==0){
System.out.println("=");
} else if (k<0){
System.out.println("<");
} else if (k>0){
System.out.println(">");
}

}

}

}

6.

/**
* Angewandte Mathematik, SS09, IFB 2C
* ACM Problem #11172 (Relational Operator)
* Link: http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=8&category=23&page=show_problem&problem=2113
*
* @author Hidir Sayli
* @author Lermer Florian
* @author Taskin Umut
* @version 1.0, 03/23/2009
*
* Status : Accepted
* Runtime: 0.160
*/


import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
int t;
int a, b;

t = sc.nextInt();

for(int i = 0; i < t; i++) {
a = sc.nextInt();
b = sc.nextInt();

if(a == b) {
System.out.println("=");
}

else {

if(a < b) {
System.out.println("<");
}

else {
System.out.println(">");
}
}
}
}
}

7.

import java.util.*;

/* Autoren: Mitterreiter Christian, Rolf Luigs
* Runtime: 0.120, Accepted
* Nummer: 11172
*/

public class Main {

public static void main(String args[]) throws Exception {

Scanner scanner = new Scanner(System.in);

int[] input = new int [500];
input[0]=scanner.nextInt(); //Gibt an, wie viele Zahlenpaare zu erwarten sind

for(int a=1;2*input[0]>=a;a++) {
input[a]=scanner.nextInt();
}
int x = 1; //Anzahl der Durchläufe; wird mit der ersten eingegebenen Zahl bestimmt
int i = 1; //Index im Array

while(x<=input[0]) {

if(input[i] > input[i+1]) System.out.println(">");
if(input[i] < input[i+1]) System.out.println("<");
if(input[i] == input[i+1])System.out.println("=");

x++;
i=i+2;
}
}
}


8.

/**
* Angewandte Mathematik SS 09
11172 Relational Operator
* UVa Status: Accepted
* Run Time: 0.000
* Programming Language: C
* @author Doina Logofatu logofatu@hm.edu
*/

#include <stdio.h>

int main() {
long x, y;
scanf("%ld", &x);
while(scanf("%ld%ld", &x, &y)==2){
if(x<y) {printf("<\n"); continue;}
if(x>y) {printf(">\n"); continue;}
printf("=\n");
}
return 0;
}