father of the archangel of death"?

e wields an axe, a sword and a machine gun and his battlefield pranks have become as legendary as his fighting against Islamic State - but who is the man that thousands online have called "father of the archangel of death"?

He‘s bald, with a prodigious beard, and often pictured with a smile on his face even when carrying his favourite weapons. A Facebook page devoted to his feats has more than 300,000 likes, with the vast majority of his fans inside Iraq itself. And he‘s been given the terrifying moniker Abu Azrael: "father of the archangel of death."

Of course nothing is quite so simple when it comes to the fight against IS, and basic facts about the Abu Azreal story are difficult to verify.
Ayyub Faleh al-Rubaie with a knife

His real name, according to a report published Tuesday by news agency AFP, is Ayyub Faleh al-Rubaie. He says that he‘s fought against IS in half a dozen places, but that his experience goes back much further than the current conflict. Rubaie told AFP that he was part of the Mahdi Army - a militia that battled US forces in Iraq. He also says that he fought near Damascus against Syrian rebels trying to unseat President Assad.

时间: 2024-10-19 06:55:53

father of the archangel of death"?的相关文章

My Father - 父爱无边

My father was a self-taught mandolin player. He was one of the best string instrument players in our town. He could not read music, but if he heard a tune a few times, he could play it. When he was younger, he was a member of a small country music ba

HDU 5129 Yong Zheng's Death

题目链接:HDU-5129 题目大意为给一堆字符串,问由任意两个字符串的前缀子串(注意断句)能组成多少种不同的字符串. 思路是先用总方案数减去重复的方案数. 考虑对于一个字符串S,如图,假设S1,S2,S3,S4,S5,S6均为前缀. 换言之,对于这种字符串,我们计算了三次. 发现,重复的方案数,等于中间如图有颜色的方块的数量.所以我们要做的也就是计数像图中有颜色的小方块的数量. 我们可以通过遍历像S6一样的字符串的数量,来计算重复的方案数.S6满足以下条件: 存在一个前缀S4为S6的后缀,且S

一些项目——Heritage from father

Problem Description Famous Harry Potter,who seemd to be a normal and poor boy,is actually a wizard.Everything changed when he had his birthday of ten years old.A huge man called 'Hagrid' found Harry and lead him to a new world full of magic power. If

hdoj-1178-Heritage from father【科学计数法表示】

Heritage from father Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 6076 Accepted Submission(s): 2214 Problem Description Famous Harry Potter,who seemd to be a normal and poor boy,is actually a

Java代码输出是“father”还是“child”(一)

1.实例 /** * 以下代码输出的结果是 */ package com.you.model; /** * @author YouHaidong * 输出的结果 */ public class FatherChild { /** * @param args */ @SuppressWarnings("static-access") public static void main(String[] args) { Father father = new Father(); Father

Java代码输出是“father”还是“child”(二)

1.实例 /** * 以下代码输出的结果是 */ package com.you.model; /** * @author YouHaidong * 输出的结果 */ public class FatherChild { /** * @param args */ @SuppressWarnings("static-access") public static void main(String[] args) { Father father = new Father(); Father

hdu 6136 Death Podracing(模拟)

题目链接:hdu 6136 Death Podracing 题意: 有n个人在一个环形的跑道上,第i个人有一个power i,每个人有一个起始点和一个不同的速度. 如果两个人相遇,那么power大的那个人就会将power小的那个人淘汰出局. 然后问决出胜负需要多少时间. 题解: 显然,每次有人被淘汰出局的时候,都是被相邻的人干掉的,那么我们先预处理出相邻的人相遇的时间,然后扔进优先队列里面,每次选择最小的时间,将一个人淘汰掉,然后再更新一下当前的局势就行了. 1 #include<bits/st

POJ 3160 Father Christmas flymouse

Father Christmas flymouse Time Limit: 1000ms Memory Limit: 131072KB This problem will be judged on PKU. Original ID: 316064-bit integer IO format: %lld      Java class name: Main After retirement as contestant from WHU ACM Team, flymouse volunteered

UVa 485 - Pascal&#39;s Triangle of Death

題目:打印Pascal三角到第一个到达10^60的行. 分析:字符串.大整數.模擬.f(i,j)= f(i-1,j-1)+ f(i-1,j) {組合數公式}. 說明:注意不小于10^60的數字有61位(⊙_⊙). #include <iostream> #include <cstdlib> #include <cstdio> using namespace std; int P[220][220][70] = {0}; int main() { for (int i =