1. 

/**
 * Angewandte Mathematik, SS09, IFB 2C
 * ACM Problem #10055 (Hashmat the brave Warrior)
 *
 *
 * @author Lermer Florian, Taskin Umut, Sayli Hidir
 *
 * Status : Accepted
 * Runtime:
 */

#include<iostream>
 
using namespace std;

int main(int argc, char *argv[])
{
long long a, b, diff;
while(cin >> a >> b)
{
diff =(( a - b)>=0)?a-b:b-a;
cout<<diff<<endl;
 }
return 0;
 }



2.
/**
* Angewandte Mathematik, SS09, IFB 2C
* ACM Problem: Hashmat the Brave Warrior (10055)
* @author Christian Mitterreiter
* @author Rolf Luigs
* @version 1.0, 03/23/2009
* Status : Accepted
* Runtime: 2.232
*/


import java.util.Scanner;

public class Main {


public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

while(sc.hasNext()) {
System.out.println(((sc.nextBigInteger()).subtract(sc.nextBigInteger())).abs());
}
}
}